./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/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_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/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-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e --- 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 06:55:29,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:55:29,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:55:29,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:55:29,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:55:29,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:55:29,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:55:29,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:55:29,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:55:29,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:55:29,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:55:29,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:55:29,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:55:29,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:55:29,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:55:29,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:55:29,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:55:29,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:55:29,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:55:29,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:55:29,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:55:29,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:55:29,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:55:29,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:55:29,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:55:29,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:55:29,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:55:29,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:55:29,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:55:29,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:55:29,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:55:29,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:55:29,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:55:29,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:55:29,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:55:29,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:55:29,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:55:29,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:55:29,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:55:29,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:55:29,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:55:29,517 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-12-14 06:55:29,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:55:29,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:55:29,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:55:29,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:55:29,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:55:29,533 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:55:29,534 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:55:29,534 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:55:29,534 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:55:29,534 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:55:29,534 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:55:29,534 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:55:29,534 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:55:29,535 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:55:29,535 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:55:29,535 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:55:29,535 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:55:29,535 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:55:29,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 06:55:29,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 06:55:29,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:55:29,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:55:29,536 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 06:55:29,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:55:29,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:55:29,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:55:29,537 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 06:55:29,537 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 06:55:29,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:55:29,538 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 06:55:29,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:55:29,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:55:29,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:55:29,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:55:29,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:55:29,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:55:29,539 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:55:29,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:55:29,539 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:55:29,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:55:29,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:55:29,539 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_78b15b2b-aa17-4723-a209-848b1519c544/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_78b15b2b-aa17-4723-a209-848b1519c544/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-memcleanup) ) 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 -> f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e [2022-12-14 06:55:29,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:55:29,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:55:29,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:55:29,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:55:29,743 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:55:29,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2022-12-14 06:55:32,344 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:55:32,541 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:55:32,542 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/sv-benchmarks/c/forester-heap/sll-circular-2.i [2022-12-14 06:55:32,549 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/data/15b54de5c/9bdb725750c6438c8509ef810e854596/FLAGe4ed77c89 [2022-12-14 06:55:32,919 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/data/15b54de5c/9bdb725750c6438c8509ef810e854596 [2022-12-14 06:55:32,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:55:32,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:55:32,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:55:32,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:55:32,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:55:32,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:55:32" (1/1) ... [2022-12-14 06:55:32,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d5724f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:32, skipping insertion in model container [2022-12-14 06:55:32,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:55:32" (1/1) ... [2022-12-14 06:55:32,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:55:32,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:55:33,165 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_78b15b2b-aa17-4723-a209-848b1519c544/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2022-12-14 06:55:33,171 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_78b15b2b-aa17-4723-a209-848b1519c544/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2022-12-14 06:55:33,172 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_78b15b2b-aa17-4723-a209-848b1519c544/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2022-12-14 06:55:33,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:55:33,187 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:55:33,218 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_78b15b2b-aa17-4723-a209-848b1519c544/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2022-12-14 06:55:33,219 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_78b15b2b-aa17-4723-a209-848b1519c544/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2022-12-14 06:55:33,221 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_78b15b2b-aa17-4723-a209-848b1519c544/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2022-12-14 06:55:33,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:55:33,242 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:55:33,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33 WrapperNode [2022-12-14 06:55:33,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:55:33,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:55:33,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:55:33,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:55:33,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,276 INFO L138 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2022-12-14 06:55:33,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:55:33,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:55:33,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:55:33,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:55:33,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,301 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:55:33,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:55:33,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:55:33,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:55:33,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (1/1) ... [2022-12-14 06:55:33,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:55:33,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:55:33,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:55:33,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:55:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 06:55:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 06:55:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 06:55:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:55:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 06:55:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 06:55:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 06:55:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:55:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:55:33,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:55:33,440 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:55:33,442 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:55:33,675 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:55:33,711 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:55:33,712 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 06:55:33,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:55:33 BoogieIcfgContainer [2022-12-14 06:55:33,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:55:33,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:55:33,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:55:33,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:55:33,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:55:32" (1/3) ... [2022-12-14 06:55:33,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b472c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:55:33, skipping insertion in model container [2022-12-14 06:55:33,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:55:33" (2/3) ... [2022-12-14 06:55:33,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b472c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:55:33, skipping insertion in model container [2022-12-14 06:55:33,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:55:33" (3/3) ... [2022-12-14 06:55:33,722 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2022-12-14 06:55:33,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:55:33,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-12-14 06:55:33,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:55:33,773 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;@6b8b59d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:55:33,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-12-14 06:55:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 43 states have (on average 2.511627906976744) internal successors, (108), 89 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 06:55:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 06:55:33,781 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:33,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 06:55:33,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash 7320, now seen corresponding path program 1 times [2022-12-14 06:55:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:33,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163285609] [2022-12-14 06:55:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:33,941 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 06:55:33,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:33,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163285609] [2022-12-14 06:55:33,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163285609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:33,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:33,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 06:55:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023876388] [2022-12-14 06:55:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:33,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:55:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:33,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:55:33,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:55:33,971 INFO L87 Difference]: Start difference. First operand has 90 states, 43 states have (on average 2.511627906976744) internal successors, (108), 89 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:34,056 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-12-14 06:55:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:55:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 06:55:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:34,065 INFO L225 Difference]: With dead ends: 96 [2022-12-14 06:55:34,065 INFO L226 Difference]: Without dead ends: 95 [2022-12-14 06:55:34,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:55:34,068 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 77 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:34,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 61 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-14 06:55:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-12-14 06:55:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 43 states have (on average 2.116279069767442) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-12-14 06:55:34,093 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 2 [2022-12-14 06:55:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:34,093 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-12-14 06:55:34,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-12-14 06:55:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 06:55:34,094 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:34,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 06:55:34,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:55:34,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash 7321, now seen corresponding path program 1 times [2022-12-14 06:55:34,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:34,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882498301] [2022-12-14 06:55:34,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:34,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:34,170 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 06:55:34,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:34,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882498301] [2022-12-14 06:55:34,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882498301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:34,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:34,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 06:55:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894034979] [2022-12-14 06:55:34,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:34,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:55:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:55:34,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:55:34,173 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:34,230 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-12-14 06:55:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:55:34,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 06:55:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:34,231 INFO L225 Difference]: With dead ends: 93 [2022-12-14 06:55:34,232 INFO L226 Difference]: Without dead ends: 93 [2022-12-14 06:55:34,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:55:34,233 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:34,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:55:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-14 06:55:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-12-14 06:55:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 80 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 06:55:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-12-14 06:55:34,240 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 2 [2022-12-14 06:55:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:34,241 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-12-14 06:55:34,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-12-14 06:55:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 06:55:34,241 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:34,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 06:55:34,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 06:55:34,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1824801511, now seen corresponding path program 1 times [2022-12-14 06:55:34,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:34,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180762360] [2022-12-14 06:55:34,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:34,306 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 06:55:34,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:34,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180762360] [2022-12-14 06:55:34,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180762360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:34,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:34,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:55:34,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362545492] [2022-12-14 06:55:34,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:34,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:55:34,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:34,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:55:34,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:55:34,309 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:34,397 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-12-14 06:55:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:55:34,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-14 06:55:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:34,398 INFO L225 Difference]: With dead ends: 79 [2022-12-14 06:55:34,398 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 06:55:34,399 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 06:55:34,400 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 120 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:34,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 41 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 06:55:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-12-14 06:55:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-12-14 06:55:34,405 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 6 [2022-12-14 06:55:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:34,405 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-12-14 06:55:34,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-12-14 06:55:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 06:55:34,406 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:34,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 06:55:34,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 06:55:34,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1824801510, now seen corresponding path program 1 times [2022-12-14 06:55:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:34,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046157619] [2022-12-14 06:55:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:34,517 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 06:55:34,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046157619] [2022-12-14 06:55:34,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046157619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:34,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:34,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:55:34,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702665415] [2022-12-14 06:55:34,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:34,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:55:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:34,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:55:34,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:55:34,520 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:34,613 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-12-14 06:55:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:55:34,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-14 06:55:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:34,614 INFO L225 Difference]: With dead ends: 87 [2022-12-14 06:55:34,614 INFO L226 Difference]: Without dead ends: 87 [2022-12-14 06:55:34,614 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 06:55:34,615 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:34,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 80 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-14 06:55:34,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-12-14 06:55:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 74 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 06:55:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-12-14 06:55:34,621 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 6 [2022-12-14 06:55:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:34,621 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-12-14 06:55:34,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-12-14 06:55:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 06:55:34,622 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:34,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:34,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 06:55:34,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:34,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1287407321, now seen corresponding path program 1 times [2022-12-14 06:55:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:34,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360815594] [2022-12-14 06:55:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:34,734 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 06:55:34,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:34,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360815594] [2022-12-14 06:55:34,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360815594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:34,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:34,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:55:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289605680] [2022-12-14 06:55:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:34,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:55:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:55:34,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:55:34,737 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:34,833 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-12-14 06:55:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:55:34,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 06:55:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:34,834 INFO L225 Difference]: With dead ends: 74 [2022-12-14 06:55:34,834 INFO L226 Difference]: Without dead ends: 74 [2022-12-14 06:55:34,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:34,835 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:34,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-14 06:55:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-12-14 06:55:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.6875) internal successors, (81), 73 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-12-14 06:55:34,840 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 8 [2022-12-14 06:55:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:34,840 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-12-14 06:55:34,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-12-14 06:55:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 06:55:34,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:34,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:34,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 06:55:34,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1287407320, now seen corresponding path program 1 times [2022-12-14 06:55:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:34,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887844795] [2022-12-14 06:55:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:35,012 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 06:55:35,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:35,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887844795] [2022-12-14 06:55:35,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887844795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:35,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:35,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:55:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992294778] [2022-12-14 06:55:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:35,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:55:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:35,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:55:35,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:55:35,014 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:35,120 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-12-14 06:55:35,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:55:35,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 06:55:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:35,121 INFO L225 Difference]: With dead ends: 70 [2022-12-14 06:55:35,121 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 06:55:35,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:35,122 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:35,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 06:55:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-12-14 06:55:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.627906976744186) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-12-14 06:55:35,126 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2022-12-14 06:55:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:35,126 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-12-14 06:55:35,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-12-14 06:55:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 06:55:35,127 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:35,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:35,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 06:55:35,127 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1260581677, now seen corresponding path program 1 times [2022-12-14 06:55:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:35,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338982462] [2022-12-14 06:55:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:35,270 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 06:55:35,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:35,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338982462] [2022-12-14 06:55:35,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338982462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:35,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:35,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:55:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792422657] [2022-12-14 06:55:35,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:35,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:55:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:55:35,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:35,272 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:35,405 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-12-14 06:55:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:55:35,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 06:55:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:35,406 INFO L225 Difference]: With dead ends: 144 [2022-12-14 06:55:35,406 INFO L226 Difference]: Without dead ends: 144 [2022-12-14 06:55:35,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:55:35,407 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 171 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:35,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 227 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-14 06:55:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 69. [2022-12-14 06:55:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-12-14 06:55:35,410 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 9 [2022-12-14 06:55:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:35,410 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-12-14 06:55:35,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-12-14 06:55:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 06:55:35,411 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:35,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:35,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 06:55:35,411 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash -423322160, now seen corresponding path program 1 times [2022-12-14 06:55:35,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402110188] [2022-12-14 06:55:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:35,533 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 06:55:35,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:35,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402110188] [2022-12-14 06:55:35,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402110188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:35,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:35,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:55:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244025426] [2022-12-14 06:55:35,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:35,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:55:35,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:35,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:55:35,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:35,535 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:35,659 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-12-14 06:55:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:55:35,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 06:55:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:35,660 INFO L225 Difference]: With dead ends: 105 [2022-12-14 06:55:35,660 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 06:55:35,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:55:35,661 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 258 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:35,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 81 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 06:55:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-12-14 06:55:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 83 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 06:55:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-12-14 06:55:35,664 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 10 [2022-12-14 06:55:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:35,664 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-12-14 06:55:35,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-12-14 06:55:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 06:55:35,664 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:35,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:35,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 06:55:35,665 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash -423322159, now seen corresponding path program 1 times [2022-12-14 06:55:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:35,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350772681] [2022-12-14 06:55:35,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:35,843 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 06:55:35,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:35,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350772681] [2022-12-14 06:55:35,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350772681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:35,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:35,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:55:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877229846] [2022-12-14 06:55:35,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:35,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:55:35,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:55:35,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:35,845 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:35,985 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-12-14 06:55:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:55:35,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 06:55:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:35,987 INFO L225 Difference]: With dead ends: 118 [2022-12-14 06:55:35,987 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 06:55:35,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 06:55:35,988 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 245 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:35,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 103 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 06:55:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2022-12-14 06:55:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 90 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 06:55:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2022-12-14 06:55:35,992 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 10 [2022-12-14 06:55:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:35,993 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2022-12-14 06:55:35,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-12-14 06:55:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 06:55:35,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:35,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:35,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 06:55:35,994 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:35,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1806268972, now seen corresponding path program 1 times [2022-12-14 06:55:35,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:35,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929598377] [2022-12-14 06:55:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:36,060 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 06:55:36,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:36,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929598377] [2022-12-14 06:55:36,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929598377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:36,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:36,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:55:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341413367] [2022-12-14 06:55:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:36,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:55:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:36,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:55:36,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:55:36,061 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:36,129 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-12-14 06:55:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:55:36,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 06:55:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:36,130 INFO L225 Difference]: With dead ends: 91 [2022-12-14 06:55:36,130 INFO L226 Difference]: Without dead ends: 91 [2022-12-14 06:55:36,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:36,131 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:36,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 175 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-14 06:55:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-12-14 06:55:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 88 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 06:55:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2022-12-14 06:55:36,134 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 12 [2022-12-14 06:55:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:36,134 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2022-12-14 06:55:36,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2022-12-14 06:55:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 06:55:36,134 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:36,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:36,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 06:55:36,135 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:36,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1166409919, now seen corresponding path program 1 times [2022-12-14 06:55:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:36,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995751359] [2022-12-14 06:55:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:36,299 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 06:55:36,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:36,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995751359] [2022-12-14 06:55:36,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995751359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:36,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:36,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:55:36,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330892375] [2022-12-14 06:55:36,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:36,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:55:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:36,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:55:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:55:36,301 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:36,490 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2022-12-14 06:55:36,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 06:55:36,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 06:55:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:36,491 INFO L225 Difference]: With dead ends: 119 [2022-12-14 06:55:36,492 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 06:55:36,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:55:36,492 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 177 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:36,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 188 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 06:55:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2022-12-14 06:55:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 91 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 06:55:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-12-14 06:55:36,496 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 13 [2022-12-14 06:55:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:36,497 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-12-14 06:55:36,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-12-14 06:55:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 06:55:36,498 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:36,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:36,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 06:55:36,498 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1166409918, now seen corresponding path program 1 times [2022-12-14 06:55:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:36,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231952299] [2022-12-14 06:55:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:36,731 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 06:55:36,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:36,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231952299] [2022-12-14 06:55:36,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231952299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:36,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:36,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:55:36,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751541584] [2022-12-14 06:55:36,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:36,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:55:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:36,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:55:36,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:36,732 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:36,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:36,952 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2022-12-14 06:55:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:55:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 06:55:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:36,954 INFO L225 Difference]: With dead ends: 131 [2022-12-14 06:55:36,954 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 06:55:36,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:55:36,954 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 145 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:36,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 183 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:55:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 06:55:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92. [2022-12-14 06:55:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 91 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 06:55:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2022-12-14 06:55:36,958 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 13 [2022-12-14 06:55:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:36,958 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2022-12-14 06:55:36,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-12-14 06:55:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 06:55:36,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:36,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:36,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 06:55:36,959 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2136007192, now seen corresponding path program 1 times [2022-12-14 06:55:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:36,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047950990] [2022-12-14 06:55:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:36,982 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 06:55:36,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047950990] [2022-12-14 06:55:36,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047950990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:36,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:36,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:55:36,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240410011] [2022-12-14 06:55:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:36,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:55:36,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:36,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:55:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:55:36,983 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:37,016 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-12-14 06:55:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:55:37,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 06:55:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:37,017 INFO L225 Difference]: With dead ends: 150 [2022-12-14 06:55:37,018 INFO L226 Difference]: Without dead ends: 150 [2022-12-14 06:55:37,018 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 06:55:37,018 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:37,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 105 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:55:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-14 06:55:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2022-12-14 06:55:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.5) internal successors, (123), 101 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-12-14 06:55:37,021 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 15 [2022-12-14 06:55:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:37,021 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-12-14 06:55:37,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-12-14 06:55:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 06:55:37,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:37,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:37,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 06:55:37,022 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:37,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2084441583, now seen corresponding path program 1 times [2022-12-14 06:55:37,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:37,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038643313] [2022-12-14 06:55:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:37,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:37,155 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 06:55:37,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:37,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038643313] [2022-12-14 06:55:37,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038643313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:37,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:37,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:55:37,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512900906] [2022-12-14 06:55:37,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:37,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:55:37,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:37,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:55:37,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:37,157 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:37,292 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-12-14 06:55:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:55:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-12-14 06:55:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:37,294 INFO L225 Difference]: With dead ends: 141 [2022-12-14 06:55:37,294 INFO L226 Difference]: Without dead ends: 141 [2022-12-14 06:55:37,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 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 06:55:37,295 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 233 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:37,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 145 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-14 06:55:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-12-14 06:55:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 104 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2022-12-14 06:55:37,297 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 16 [2022-12-14 06:55:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:37,297 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2022-12-14 06:55:37,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2022-12-14 06:55:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 06:55:37,298 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:37,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:37,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 06:55:37,298 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:37,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2065219022, now seen corresponding path program 1 times [2022-12-14 06:55:37,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:37,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558055298] [2022-12-14 06:55:37,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:37,555 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 06:55:37,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558055298] [2022-12-14 06:55:37,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558055298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:37,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:37,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 06:55:37,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526870494] [2022-12-14 06:55:37,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:37,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 06:55:37,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:37,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 06:55:37,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:55:37,557 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:37,936 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-12-14 06:55:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:55:37,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-12-14 06:55:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:37,938 INFO L225 Difference]: With dead ends: 120 [2022-12-14 06:55:37,938 INFO L226 Difference]: Without dead ends: 120 [2022-12-14 06:55:37,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-12-14 06:55:37,939 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:37,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 252 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:55:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-14 06:55:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2022-12-14 06:55:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 104 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2022-12-14 06:55:37,941 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 16 [2022-12-14 06:55:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:37,941 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2022-12-14 06:55:37,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2022-12-14 06:55:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:55:37,941 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:37,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:37,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 06:55:37,942 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:37,942 INFO L85 PathProgramCache]: Analyzing trace with hash 193251577, now seen corresponding path program 1 times [2022-12-14 06:55:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:37,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185415100] [2022-12-14 06:55:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:38,070 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 06:55:38,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:38,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185415100] [2022-12-14 06:55:38,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185415100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:38,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:38,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:55:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754869439] [2022-12-14 06:55:38,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:38,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:55:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:55:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:55:38,072 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:38,234 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-12-14 06:55:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 06:55:38,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 06:55:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:38,235 INFO L225 Difference]: With dead ends: 146 [2022-12-14 06:55:38,235 INFO L226 Difference]: Without dead ends: 146 [2022-12-14 06:55:38,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:55:38,236 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 231 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:38,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 202 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-14 06:55:38,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2022-12-14 06:55:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 107 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-12-14 06:55:38,238 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 17 [2022-12-14 06:55:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:38,238 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-12-14 06:55:38,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-12-14 06:55:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:55:38,238 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:38,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:38,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 06:55:38,239 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash -403091939, now seen corresponding path program 1 times [2022-12-14 06:55:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:38,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996178336] [2022-12-14 06:55:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:38,445 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 06:55:38,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:38,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996178336] [2022-12-14 06:55:38,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996178336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:38,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:38,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:55:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767286813] [2022-12-14 06:55:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:38,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:55:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:55:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:55:38,447 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:38,651 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2022-12-14 06:55:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 06:55:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 06:55:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:38,652 INFO L225 Difference]: With dead ends: 128 [2022-12-14 06:55:38,652 INFO L226 Difference]: Without dead ends: 128 [2022-12-14 06:55:38,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:55:38,653 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 189 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:38,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 186 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-14 06:55:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2022-12-14 06:55:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-12-14 06:55:38,656 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 17 [2022-12-14 06:55:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:38,656 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-12-14 06:55:38,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-12-14 06:55:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:55:38,657 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:38,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:38,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 06:55:38,657 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -403091938, now seen corresponding path program 1 times [2022-12-14 06:55:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:38,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675922508] [2022-12-14 06:55:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:38,903 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 06:55:38,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:38,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675922508] [2022-12-14 06:55:38,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675922508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:38,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:38,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:55:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812089244] [2022-12-14 06:55:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:38,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:55:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:38,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:55:38,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:55:38,905 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:39,078 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2022-12-14 06:55:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:55:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 06:55:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:39,079 INFO L225 Difference]: With dead ends: 139 [2022-12-14 06:55:39,079 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 06:55:39,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:55:39,079 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 171 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:39,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 150 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 06:55:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2022-12-14 06:55:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.434782608695652) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2022-12-14 06:55:39,082 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 17 [2022-12-14 06:55:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:39,082 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2022-12-14 06:55:39,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2022-12-14 06:55:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 06:55:39,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:39,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:39,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 06:55:39,083 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1693608402, now seen corresponding path program 1 times [2022-12-14 06:55:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:39,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193336827] [2022-12-14 06:55:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:39,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:39,243 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 06:55:39,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:39,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193336827] [2022-12-14 06:55:39,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193336827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:39,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:39,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:55:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131591953] [2022-12-14 06:55:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:39,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:55:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:55:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:55:39,244 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:39,382 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2022-12-14 06:55:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:55:39,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 06:55:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:39,383 INFO L225 Difference]: With dead ends: 126 [2022-12-14 06:55:39,383 INFO L226 Difference]: Without dead ends: 122 [2022-12-14 06:55:39,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-14 06:55:39,384 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 136 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:39,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 199 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-14 06:55:39,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-12-14 06:55:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 109 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2022-12-14 06:55:39,387 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 18 [2022-12-14 06:55:39,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:39,387 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2022-12-14 06:55:39,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2022-12-14 06:55:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 06:55:39,388 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:39,388 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:39,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 06:55:39,388 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 303022428, now seen corresponding path program 1 times [2022-12-14 06:55:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:39,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030575538] [2022-12-14 06:55:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:55:39,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:39,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030575538] [2022-12-14 06:55:39,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030575538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:55:39,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448972727] [2022-12-14 06:55:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:39,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:55:39,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:55:39,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:55:39,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 06:55:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:39,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 06:55:39,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:55:39,730 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 06:55:39,789 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 06:55:39,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 06:55:39,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 06:55:39,890 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:55:39,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-12-14 06:55:39,916 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:55:39,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-12-14 06:55:39,960 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:55:39,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 06:55:39,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 06:55:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:55:39,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:55:40,047 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_451 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_451) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-12-14 06:55:40,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:55:40,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-12-14 06:55:40,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:55:40,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-12-14 06:55:40,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-12-14 06:55:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:55:40,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448972727] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:55:40,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [936377620] [2022-12-14 06:55:40,204 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-12-14 06:55:40,205 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:55:40,208 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:55:40,211 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:55:40,212 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:55:40,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 06:55:40,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 06:55:40,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 06:55:40,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 06:55:40,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 06:55:40,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-12-14 06:55:40,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-12-14 06:55:40,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-12-14 06:55:40,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 06:55:40,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 06:55:40,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 06:55:40,442 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 06:55:40,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 47 [2022-12-14 06:55:40,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-12-14 06:55:40,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 06:55:40,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2022-12-14 06:55:40,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 06:55:40,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-12-14 06:55:40,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-12-14 06:55:40,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-12-14 06:55:40,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-12-14 06:55:40,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2022-12-14 06:55:40,678 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-12-14 06:55:40,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 120 [2022-12-14 06:55:40,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-12-14 06:55:40,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2022-12-14 06:55:40,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:40,805 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-14 06:55:40,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 364 [2022-12-14 06:55:40,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:40,831 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-12-14 06:55:40,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 437 [2022-12-14 06:55:40,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:40,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:40,898 INFO L321 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-12-14 06:55:40,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 453 treesize of output 455 [2022-12-14 06:55:41,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:41,186 INFO L321 Elim1Store]: treesize reduction 278, result has 12.0 percent of original size [2022-12-14 06:55:41,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 461 treesize of output 468 [2022-12-14 06:55:41,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:41,369 INFO L321 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2022-12-14 06:55:41,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 555 treesize of output 440 [2022-12-14 06:55:41,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:41,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:41,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:41,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:41,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:41,464 INFO L321 Elim1Store]: treesize reduction 170, result has 17.1 percent of original size [2022-12-14 06:55:41,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 504 treesize of output 490 [2022-12-14 06:55:41,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:41,513 INFO L321 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2022-12-14 06:55:41,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 491 treesize of output 477 [2022-12-14 06:55:41,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:41,899 INFO L321 Elim1Store]: treesize reduction 176, result has 15.8 percent of original size [2022-12-14 06:55:41,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 812 treesize of output 506 [2022-12-14 06:55:41,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:42,024 INFO L321 Elim1Store]: treesize reduction 188, result has 17.9 percent of original size [2022-12-14 06:55:42,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 823 treesize of output 721 [2022-12-14 06:55:42,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:42,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:55:42,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:55:42,221 INFO L321 Elim1Store]: treesize reduction 424, result has 12.9 percent of original size [2022-12-14 06:55:42,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 760 treesize of output 741 [2022-12-14 06:55:42,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 06:55:42,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:55:42,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 06:55:42,411 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 06:55:42,411 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 06:55:42,429 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 06:55:42,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 06:55:42,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 06:55:42,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 06:55:42,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 06:55:42,530 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-12-14 06:55:42,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 173 [2022-12-14 06:55:42,579 INFO L321 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2022-12-14 06:55:42,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 162 [2022-12-14 06:55:42,617 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-12-14 06:55:42,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 145 [2022-12-14 06:55:42,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 06:55:42,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 06:55:42,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:55:42,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 06:55:42,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:55:42,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 06:55:42,788 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 06:55:42,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 06:55:42,806 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 06:55:42,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 06:55:42,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 06:55:42,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 06:55:42,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 06:55:42,833 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:55:43,365 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4303#(and (= |ULTIMATE.start_main_~state~0#1| 1) (<= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_85| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (and (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_85|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_85|) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_85|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_71|)) |ULTIMATE.start_main_~state~0#1|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 06:55:43,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 06:55:43,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:55:43,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2022-12-14 06:55:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118454174] [2022-12-14 06:55:43,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:55:43,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 06:55:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 06:55:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=4, NotChecked=60, Total=1056 [2022-12-14 06:55:43,366 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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 06:55:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:43,823 INFO L93 Difference]: Finished difference Result 205 states and 232 transitions. [2022-12-14 06:55:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:55:43,823 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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 18 [2022-12-14 06:55:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:43,824 INFO L225 Difference]: With dead ends: 205 [2022-12-14 06:55:43,825 INFO L226 Difference]: Without dead ends: 205 [2022-12-14 06:55:43,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=1226, Unknown=4, NotChecked=72, Total=1482 [2022-12-14 06:55:43,826 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 382 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:43,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 489 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 748 Invalid, 0 Unknown, 144 Unchecked, 0.3s Time] [2022-12-14 06:55:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-14 06:55:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 128. [2022-12-14 06:55:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 127 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2022-12-14 06:55:43,830 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 18 [2022-12-14 06:55:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:43,830 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2022-12-14 06:55:43,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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 06:55:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2022-12-14 06:55:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 06:55:43,831 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:43,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:43,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 06:55:44,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:55:44,033 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1031178538, now seen corresponding path program 1 times [2022-12-14 06:55:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:44,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187255099] [2022-12-14 06:55:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:44,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:55:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:55:44,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:55:44,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187255099] [2022-12-14 06:55:44,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187255099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:55:44,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:55:44,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 06:55:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098236822] [2022-12-14 06:55:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:55:44,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 06:55:44,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:55:44,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 06:55:44,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:55:44,263 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:55:44,431 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-12-14 06:55:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:55:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 06:55:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:55:44,432 INFO L225 Difference]: With dead ends: 130 [2022-12-14 06:55:44,432 INFO L226 Difference]: Without dead ends: 127 [2022-12-14 06:55:44,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-12-14 06:55:44,433 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 114 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:55:44,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 285 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:55:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-14 06:55:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2022-12-14 06:55:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4) internal successors, (133), 114 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2022-12-14 06:55:44,436 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 19 [2022-12-14 06:55:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:55:44,437 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2022-12-14 06:55:44,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:55:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2022-12-14 06:55:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 06:55:44,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:55:44,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:55:44,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 06:55:44,438 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-12-14 06:55:44,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:55:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash -824217396, now seen corresponding path program 1 times [2022-12-14 06:55:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:55:44,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102628696] [2022-12-14 06:55:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:55:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:55:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:55:44,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 06:55:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:55:44,475 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 06:55:44,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 06:55:44,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining) [2022-12-14 06:55:44,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining) [2022-12-14 06:55:44,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining) [2022-12-14 06:55:44,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining) [2022-12-14 06:55:44,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining) [2022-12-14 06:55:44,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining) [2022-12-14 06:55:44,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining) [2022-12-14 06:55:44,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining) [2022-12-14 06:55:44,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (32 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining) [2022-12-14 06:55:44,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining) [2022-12-14 06:55:44,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (27 of 46 remaining) [2022-12-14 06:55:44,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining) [2022-12-14 06:55:44,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining) [2022-12-14 06:55:44,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining) [2022-12-14 06:55:44,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining) [2022-12-14 06:55:44,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 46 remaining) [2022-12-14 06:55:44,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining) [2022-12-14 06:55:44,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 46 remaining) [2022-12-14 06:55:44,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 46 remaining) [2022-12-14 06:55:44,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 46 remaining) [2022-12-14 06:55:44,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining) [2022-12-14 06:55:44,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining) [2022-12-14 06:55:44,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining) [2022-12-14 06:55:44,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining) [2022-12-14 06:55:44,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining) [2022-12-14 06:55:44,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (6 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (5 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (4 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (3 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (2 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (1 of 46 remaining) [2022-12-14 06:55:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (0 of 46 remaining) [2022-12-14 06:55:44,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 06:55:44,485 INFO L445 BasicCegarLoop]: Path program histogram: [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 06:55:44,487 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 06:55:44,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 06:55:44 BoogieIcfgContainer [2022-12-14 06:55:44,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 06:55:44,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 06:55:44,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 06:55:44,504 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 06:55:44,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:55:33" (3/4) ... [2022-12-14 06:55:44,506 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 06:55:44,534 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 06:55:44,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 06:55:44,535 INFO L158 Benchmark]: Toolchain (without parser) took 11613.38ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 167.4MB in the beginning and 125.0MB in the end (delta: 42.4MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. [2022-12-14 06:55:44,535 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:55:44,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.90ms. Allocated memory is still 203.4MB. Free memory was 166.8MB in the beginning and 149.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 06:55:44,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.68ms. Allocated memory is still 203.4MB. Free memory was 149.4MB in the beginning and 147.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:55:44,536 INFO L158 Benchmark]: Boogie Preprocessor took 26.57ms. Allocated memory is still 203.4MB. Free memory was 147.9MB in the beginning and 145.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:55:44,536 INFO L158 Benchmark]: RCFGBuilder took 410.42ms. Allocated memory is still 203.4MB. Free memory was 145.8MB in the beginning and 123.6MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 06:55:44,536 INFO L158 Benchmark]: TraceAbstraction took 10785.78ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 122.8MB in the beginning and 127.1MB in the end (delta: -4.3MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2022-12-14 06:55:44,536 INFO L158 Benchmark]: Witness Printer took 31.11ms. Allocated memory is still 295.7MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:55:44,537 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.90ms. Allocated memory is still 203.4MB. Free memory was 166.8MB in the beginning and 149.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.68ms. Allocated memory is still 203.4MB. Free memory was 149.4MB in the beginning and 147.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.57ms. Allocated memory is still 203.4MB. Free memory was 147.9MB in the beginning and 145.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.42ms. Allocated memory is still 203.4MB. Free memory was 145.8MB in the beginning and 123.6MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10785.78ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 122.8MB in the beginning and 127.1MB in the end (delta: -4.3MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. * Witness Printer took 31.11ms. Allocated memory is still 295.7MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1032]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head VAL [head={-1:0}] [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1027] EXPR head->next [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3078 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3078 mSDsluCounter, 3473 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 144 IncrementalHoareTripleChecker+Unchecked, 2543 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3566 IncrementalHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 930 mSDtfsCounter, 3566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=20, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 521 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 265 ConstructedInterpolants, 11 QuantifiedInterpolants, 3394 SizeOfPredicates, 5 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 06:55:44,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78b15b2b-aa17-4723-a209-848b1519c544/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)