./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:51:19,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:51:19,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:51:19,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:51:19,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:51:19,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:51:19,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:51:19,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:51:19,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:51:19,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:51:19,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:51:19,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:51:19,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:51:19,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:51:19,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:51:19,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:51:19,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:51:19,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:51:19,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:51:19,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:51:19,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:51:19,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:51:19,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:51:19,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:51:19,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:51:19,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:51:19,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:51:19,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:51:19,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:51:19,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:51:19,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:51:19,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:51:19,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:51:19,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:51:19,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:51:19,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:51:19,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:51:19,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:51:19,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:51:19,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:51:19,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:51:19,312 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:51:19,336 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:51:19,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:51:19,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:51:19,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:51:19,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:51:19,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:51:19,338 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:51:19,339 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:51:19,339 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:51:19,339 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:51:19,339 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:51:19,340 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:51:19,340 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:51:19,340 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:51:19,340 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:51:19,341 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:51:19,341 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:51:19,341 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:51:19,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:51:19,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:51:19,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:51:19,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:51:19,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:51:19,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:51:19,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:51:19,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:51:19,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:51:19,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:51:19,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:51:19,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:51:19,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:51:19,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:51:19,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:51:19,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:51:19,347 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:51:19,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:51:19,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:51:19,347 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:51:19,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:51:19,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:51:19,348 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:51:19,348 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-11-25 23:51:19,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:51:19,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:51:19,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:51:19,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:51:19,633 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:51:19,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-11-25 23:51:22,909 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:51:23,185 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:51:23,186 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-11-25 23:51:23,213 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/data/8ba2fa263/3733198d939e40f19211786c1d602b61/FLAGb3862eb43 [2022-11-25 23:51:23,228 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/data/8ba2fa263/3733198d939e40f19211786c1d602b61 [2022-11-25 23:51:23,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:51:23,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:51:23,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:51:23,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:51:23,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:51:23,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd6625f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23, skipping insertion in model container [2022-11-25 23:51:23,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:51:23,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:51:23,668 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-11-25 23:51:23,687 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-11-25 23:51:23,691 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-11-25 23:51:23,693 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-11-25 23:51:23,703 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-11-25 23:51:23,706 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-11-25 23:51:23,711 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-11-25 23:51:23,714 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-11-25 23:51:23,716 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-11-25 23:51:23,721 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-11-25 23:51:23,724 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-11-25 23:51:23,725 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-11-25 23:51:23,727 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-11-25 23:51:23,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:51:23,742 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:51:23,776 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-11-25 23:51:23,779 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-11-25 23:51:23,781 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-11-25 23:51:23,782 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-11-25 23:51:23,785 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-11-25 23:51:23,786 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-11-25 23:51:23,789 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-11-25 23:51:23,790 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-11-25 23:51:23,791 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-11-25 23:51:23,793 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-11-25 23:51:23,798 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-11-25 23:51:23,803 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-11-25 23:51:23,807 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_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-11-25 23:51:23,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:51:23,846 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:51:23,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23 WrapperNode [2022-11-25 23:51:23,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:51:23,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:51:23,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:51:23,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:51:23,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,910 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2022-11-25 23:51:23,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:51:23,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:51:23,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:51:23,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:51:23,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,948 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:51:23,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:51:23,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:51:23,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:51:23,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (1/1) ... [2022-11-25 23:51:23,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:51:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:23,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:51:24,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:51:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:51:24,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:51:24,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:51:24,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:51:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:51:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:51:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:51:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:51:24,186 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:51:24,188 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:51:24,679 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:51:24,814 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:51:24,815 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-25 23:51:24,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:51:24 BoogieIcfgContainer [2022-11-25 23:51:24,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:51:24,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:51:24,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:51:24,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:51:24,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:51:23" (1/3) ... [2022-11-25 23:51:24,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aaa5a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:51:24, skipping insertion in model container [2022-11-25 23:51:24,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:51:23" (2/3) ... [2022-11-25 23:51:24,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aaa5a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:51:24, skipping insertion in model container [2022-11-25 23:51:24,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:51:24" (3/3) ... [2022-11-25 23:51:24,826 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-11-25 23:51:24,853 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:51:24,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-11-25 23:51:24,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:51:24,921 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@c12a6d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:51:24,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 23:51:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 60 states have (on average 1.9666666666666666) internal successors, (118), 73 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:51:24,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:24,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:51:24,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 351983, now seen corresponding path program 1 times [2022-11-25 23:51:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:24,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267768597] [2022-11-25 23:51:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:25,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:25,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267768597] [2022-11-25 23:51:25,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267768597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:25,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:25,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:51:25,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368461333] [2022-11-25 23:51:25,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:25,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:51:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:51:25,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:25,194 INFO L87 Difference]: Start difference. First operand has 74 states, 60 states have (on average 1.9666666666666666) internal successors, (118), 73 states have internal predecessors, (118), 0 states have call successors, (0), 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, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:25,281 INFO L93 Difference]: Finished difference Result 163 states and 262 transitions. [2022-11-25 23:51:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:51:25,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:51:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:25,293 INFO L225 Difference]: With dead ends: 163 [2022-11-25 23:51:25,293 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 23:51:25,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:25,300 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:25,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 78 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:51:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 23:51:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2022-11-25 23:51:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.271186440677966) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-11-25 23:51:25,349 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 3 [2022-11-25 23:51:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:25,350 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-11-25 23:51:25,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-11-25 23:51:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:51:25,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:25,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:25,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:51:25,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:25,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1222017071, now seen corresponding path program 1 times [2022-11-25 23:51:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:25,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377668987] [2022-11-25 23:51:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:25,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:25,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377668987] [2022-11-25 23:51:25,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377668987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:25,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:25,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:51:25,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159880146] [2022-11-25 23:51:25,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:25,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:51:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:51:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:25,948 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:26,050 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-11-25 23:51:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:51:26,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:51:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:26,055 INFO L225 Difference]: With dead ends: 71 [2022-11-25 23:51:26,055 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 23:51:26,055 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-11-25 23:51:26,057 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:26,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 23:51:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-25 23:51:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-11-25 23:51:26,083 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 7 [2022-11-25 23:51:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:26,083 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-11-25 23:51:26,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-11-25 23:51:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:51:26,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:26,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:26,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:51:26,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:26,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1494561990, now seen corresponding path program 1 times [2022-11-25 23:51:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:26,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573540267] [2022-11-25 23:51:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:26,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:26,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573540267] [2022-11-25 23:51:26,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573540267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:26,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:26,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:51:26,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84236770] [2022-11-25 23:51:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:26,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:51:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:26,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:51:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:26,291 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:26,418 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-11-25 23:51:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:51:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 23:51:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:26,422 INFO L225 Difference]: With dead ends: 72 [2022-11-25 23:51:26,422 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 23:51:26,423 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-11-25 23:51:26,427 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:26,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 23:51:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-11-25 23:51:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-25 23:51:26,445 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2022-11-25 23:51:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:26,447 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-25 23:51:26,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-25 23:51:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:51:26,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:26,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:26,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:51:26,449 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -913214366, now seen corresponding path program 1 times [2022-11-25 23:51:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:26,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765231536] [2022-11-25 23:51:26,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:26,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765231536] [2022-11-25 23:51:26,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765231536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:26,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:26,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:51:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635361060] [2022-11-25 23:51:26,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:51:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:51:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:51:26,628 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:26,790 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2022-11-25 23:51:26,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:51:26,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-11-25 23:51:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:26,792 INFO L225 Difference]: With dead ends: 123 [2022-11-25 23:51:26,792 INFO L226 Difference]: Without dead ends: 103 [2022-11-25 23:51:26,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:51:26,794 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 115 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:26,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 95 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-25 23:51:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-11-25 23:51:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-11-25 23:51:26,802 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2022-11-25 23:51:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:26,803 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-11-25 23:51:26,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-11-25 23:51:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:51:26,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:26,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:26,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:51:26,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:26,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:26,806 INFO L85 PathProgramCache]: Analyzing trace with hash 144664444, now seen corresponding path program 1 times [2022-11-25 23:51:26,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:26,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462998575] [2022-11-25 23:51:26,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:26,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:26,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462998575] [2022-11-25 23:51:26,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462998575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:26,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:26,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:51:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161029267] [2022-11-25 23:51:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:26,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:51:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:51:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:26,935 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-25 23:51:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:27,017 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-11-25 23:51:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:51:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-25 23:51:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:27,021 INFO L225 Difference]: With dead ends: 89 [2022-11-25 23:51:27,023 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 23:51:27,024 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-11-25 23:51:27,025 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:27,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 113 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 23:51:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2022-11-25 23:51:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2022-11-25 23:51:27,039 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 17 [2022-11-25 23:51:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:27,040 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2022-11-25 23:51:27,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-25 23:51:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-11-25 23:51:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:51:27,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:27,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:27,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:51:27,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash 144668194, now seen corresponding path program 1 times [2022-11-25 23:51:27,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:27,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283251737] [2022-11-25 23:51:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:27,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:27,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283251737] [2022-11-25 23:51:27,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283251737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:27,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:27,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:51:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638092225] [2022-11-25 23:51:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:27,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:51:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:27,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:51:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:27,185 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-25 23:51:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:27,257 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-25 23:51:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:51:27,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-25 23:51:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:27,259 INFO L225 Difference]: With dead ends: 66 [2022-11-25 23:51:27,259 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 23:51:27,259 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-11-25 23:51:27,260 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:27,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 23:51:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 23:51:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-25 23:51:27,290 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 17 [2022-11-25 23:51:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:27,291 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-25 23:51:27,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-25 23:51:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-25 23:51:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:51:27,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:27,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:27,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:51:27,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:27,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:27,295 INFO L85 PathProgramCache]: Analyzing trace with hash -757097879, now seen corresponding path program 1 times [2022-11-25 23:51:27,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:27,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236545603] [2022-11-25 23:51:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:27,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:27,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236545603] [2022-11-25 23:51:27,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236545603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:27,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:27,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:51:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050012802] [2022-11-25 23:51:27,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:27,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:51:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:27,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:51:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:27,758 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:27,818 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-11-25 23:51:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:51:27,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:51:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:27,820 INFO L225 Difference]: With dead ends: 64 [2022-11-25 23:51:27,820 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 23:51:27,821 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-11-25 23:51:27,821 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:27,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 23:51:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 23:51:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-11-25 23:51:27,831 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 18 [2022-11-25 23:51:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:27,831 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-11-25 23:51:27,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-11-25 23:51:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:51:27,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:27,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:27,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:51:27,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1962063933, now seen corresponding path program 1 times [2022-11-25 23:51:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:27,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147196252] [2022-11-25 23:51:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:27,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:31,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:31,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147196252] [2022-11-25 23:51:31,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147196252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:31,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:31,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 23:51:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393988401] [2022-11-25 23:51:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:31,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:51:31,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:31,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:51:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:51:31,462 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:32,316 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2022-11-25 23:51:32,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:51:32,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:51:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:32,319 INFO L225 Difference]: With dead ends: 161 [2022-11-25 23:51:32,319 INFO L226 Difference]: Without dead ends: 159 [2022-11-25 23:51:32,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:51:32,321 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 295 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:32,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 254 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:51:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-25 23:51:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 73. [2022-11-25 23:51:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-11-25 23:51:32,348 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 20 [2022-11-25 23:51:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:32,348 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-11-25 23:51:32,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-11-25 23:51:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:51:32,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:32,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:32,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:51:32,351 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:32,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -303756794, now seen corresponding path program 1 times [2022-11-25 23:51:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:32,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397584656] [2022-11-25 23:51:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:51:32,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:32,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397584656] [2022-11-25 23:51:32,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397584656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:32,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:32,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:51:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884237672] [2022-11-25 23:51:32,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:32,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:51:32,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:32,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:51:32,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:32,432 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:32,539 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-11-25 23:51:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:51:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-25 23:51:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:32,540 INFO L225 Difference]: With dead ends: 73 [2022-11-25 23:51:32,540 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 23:51:32,541 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-11-25 23:51:32,542 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:32,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 53 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 23:51:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 23:51:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-25 23:51:32,561 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 23 [2022-11-25 23:51:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:32,561 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-25 23:51:32,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-25 23:51:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:51:32,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:32,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:32,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:51:32,563 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1640808980, now seen corresponding path program 1 times [2022-11-25 23:51:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493238390] [2022-11-25 23:51:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:35,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:35,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493238390] [2022-11-25 23:51:35,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493238390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:35,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:35,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 23:51:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474805367] [2022-11-25 23:51:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:35,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:51:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:51:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:51:35,780 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:36,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:36,647 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2022-11-25 23:51:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:51:36,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-25 23:51:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:36,649 INFO L225 Difference]: With dead ends: 153 [2022-11-25 23:51:36,649 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 23:51:36,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:51:36,650 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 266 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:36,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 215 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:51:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 23:51:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2022-11-25 23:51:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.173913043478261) 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-11-25 23:51:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-25 23:51:36,675 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 23 [2022-11-25 23:51:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:36,676 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-25 23:51:36,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-25 23:51:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:51:36,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:36,677 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:36,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:51:36,678 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1119815427, now seen corresponding path program 1 times [2022-11-25 23:51:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:36,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455721139] [2022-11-25 23:51:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:39,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:39,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455721139] [2022-11-25 23:51:39,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455721139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:51:39,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603124430] [2022-11-25 23:51:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:39,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:39,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:51:39,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:51:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:39,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-25 23:51:39,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:51:39,532 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-11-25 23:51:39,539 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-11-25 23:51:39,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:51:39,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:39,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 240 [2022-11-25 23:51:39,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:39,852 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 270 [2022-11-25 23:51:39,971 INFO L321 Elim1Store]: treesize reduction 71, result has 24.5 percent of original size [2022-11-25 23:51:39,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 300 treesize of output 375 [2022-11-25 23:51:40,023 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 220 treesize of output 216 [2022-11-25 23:51:40,049 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 216 treesize of output 212 [2022-11-25 23:51:40,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 225 [2022-11-25 23:51:40,151 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 206 treesize of output 202 [2022-11-25 23:51:40,187 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 202 treesize of output 198 [2022-11-25 23:51:40,228 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 113 treesize of output 89 [2022-11-25 23:51:40,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:51:40,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-25 23:51:40,479 INFO L321 Elim1Store]: treesize reduction 80, result has 13.0 percent of original size [2022-11-25 23:51:40,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 77 [2022-11-25 23:51:40,694 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-25 23:51:40,694 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 2 case distinctions, treesize of input 30 treesize of output 44 [2022-11-25 23:51:40,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:40,712 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 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-25 23:51:40,723 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 7 treesize of output 5 [2022-11-25 23:51:40,783 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 27 treesize of output 3 [2022-11-25 23:51:40,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:40,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:40,804 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 0 case distinctions, treesize of input 35 treesize of output 11 [2022-11-25 23:51:40,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:40,833 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 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-25 23:51:40,848 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 15 treesize of output 11 [2022-11-25 23:51:41,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 23:51:41,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:51:41,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 23:51:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:41,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:41,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:51:41,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 224 [2022-11-25 23:51:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:42,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603124430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:42,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470001036] [2022-11-25 23:51:42,061 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:51:42,061 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:51:42,065 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:51:42,072 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:51:42,073 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:51:42,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:51:42,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:51:42,171 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-11-25 23:51:42,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-25 23:51:42,215 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:51:42,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:51:42,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:51:42,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:42,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:42,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:42,423 INFO L321 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2022-11-25 23:51:42,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 532 treesize of output 552 [2022-11-25 23:51:42,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:42,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:42,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:42,526 INFO L321 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-11-25 23:51:42,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 207 treesize of output 230 [2022-11-25 23:51:42,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 179 [2022-11-25 23:51:42,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 9 [2022-11-25 23:51:42,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 9 [2022-11-25 23:51:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:42,783 INFO L321 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2022-11-25 23:51:42,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 67 [2022-11-25 23:51:42,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:42,863 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 28 treesize of output 36 [2022-11-25 23:51:42,907 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 49 treesize of output 38 [2022-11-25 23:51:42,920 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 13 treesize of output 9 [2022-11-25 23:51:42,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:42,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 22 [2022-11-25 23:51:42,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:42,998 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 0 case distinctions, treesize of input 22 treesize of output 14 [2022-11-25 23:51:43,053 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 34 treesize of output 20 [2022-11-25 23:51:43,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-11-25 23:51:43,098 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-25 23:51:43,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 70 [2022-11-25 23:51:43,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:43,114 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 0 case distinctions, treesize of input 53 treesize of output 35 [2022-11-25 23:51:43,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:43,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:43,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-25 23:51:43,291 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 51 treesize of output 34 [2022-11-25 23:51:44,372 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:51:45,054 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse30 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse18 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select .cse30 .cse18)) (.cse5 (select .cse31 .cse18))) (and (< 0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_#NULL.offset| 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 1)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 2)) (let ((.cse1 (= |c_ULTIMATE.start_main_#t~mem6#1.base| 0)) (.cse0 (= |c_ULTIMATE.start_main_#t~mem6#1.offset| 0))) (or (and (or (not .cse0) (not .cse1)) |c_ULTIMATE.start_main_#t~short8#1|) (and (= .cse2 |c_ULTIMATE.start_main_#t~mem7#1.offset|) .cse1 .cse0 (let ((.cse3 (= |c_ULTIMATE.start_main_#t~mem7#1.base| 0)) (.cse4 (= |c_ULTIMATE.start_main_#t~mem7#1.offset| 0))) (or (and (or (not .cse3) (not .cse4)) (not |c_ULTIMATE.start_main_#t~short8#1|)) (and .cse3 |c_ULTIMATE.start_main_#t~short8#1| .cse4))) (= |c_ULTIMATE.start_main_#t~mem7#1.base| .cse5)))) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_#t~mem6#1.base| .cse5) (< |c_ULTIMATE.start_main_~list~0#1.base| |c_#StackHeapBarrier|) (= .cse2 |c_ULTIMATE.start_main_#t~mem6#1.offset|) (let ((.cse29 (select |c_#memory_int| 1))) (let ((.cse10 (select .cse29 1)) (.cse25 (select .cse31 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse19 (select .cse30 |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse6 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse7 (= .cse19 0)) (.cse8 (= (select |c_#valid| 0) 0)) (.cse11 (= .cse25 0)) (.cse12 (= 2 (select |c_#length| 1))) (.cse13 (= (select |c_#valid| 1) 1)) (.cse14 (= (select |c_#length| 2) 11)) (.cse15 (= (select |c_#valid| 2) 1)) (.cse16 (= .cse10 0)) (.cse20 (= 0 .cse5)) (.cse21 (= (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|) 8)) (.cse22 (= 48 (select .cse29 0))) (.cse23 (= .cse2 0))) (or (and .cse6 .cse7 .cse8 (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_12) 1))) (and (= (select .cse9 1) .cse10) (= (select .cse9 0) 48)))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((v_arrayElimCell_60 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_9) v_arrayElimCell_60 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select v_DerPreprocessor_10 4) 0) (= (select .cse17 .cse18) 0) (= (select .cse17 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse19) (= (select v_DerPreprocessor_10 0) 0) (= .cse17 v_DerPreprocessor_9)))) .cse20 .cse21 .cse22 .cse23) (let ((.cse27 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse24 (select |c_#memory_$Pointer$.base| .cse5))) (and (not (= 2 .cse5)) .cse6 (not (= 1 .cse5)) .cse7 .cse8 (< .cse5 |c_#StackHeapBarrier|) (= (select .cse24 4) 0) .cse12 .cse13 .cse14 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse26 (select v_DerPreprocessor_6 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= .cse25 .cse26) (= .cse26 0) (= v_DerPreprocessor_7 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse5)) (= (select v_DerPreprocessor_6 .cse18) 0)))) (= (select .cse27 0) 0) .cse15 (= (select .cse27 4) 0) .cse16 .cse21 .cse22 (not .cse20) .cse23 (= (select |c_#valid| .cse5) 1) (= (select .cse24 0) 0) (= (select |c_#length| .cse5) 8))) (and .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) 1))) (and (= .cse10 (select .cse28 1)) (= (select .cse28 0) 48)))) .cse20 .cse21 .cse22 .cse23)))))))) is different from true [2022-11-25 23:51:45,066 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_#NULL.offset| 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 1)) (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 2)) (= |c_#NULL.base| 0) (< |c_ULTIMATE.start_main_~list~0#1.base| |c_#StackHeapBarrier|) (let ((.cse24 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse25 (select |c_#memory_int| 1)) (.cse26 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse18 (select .cse26 .cse12)) (.cse4 (select .cse25 1)) (.cse20 (select .cse26 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse13 (select .cse24 |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse1 (= .cse13 0)) (.cse2 (= (select |c_#valid| 0) 0)) (.cse5 (= .cse20 0)) (.cse6 (= 2 (select |c_#length| 1))) (.cse7 (= (select |c_#valid| 1) 1)) (.cse8 (= (select |c_#length| 2) 11)) (.cse9 (= (select |c_#valid| 2) 1)) (.cse10 (= .cse4 0)) (.cse14 (= 0 .cse18)) (.cse15 (= (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|) 8)) (.cse16 (= 48 (select .cse25 0))) (.cse17 (= (select .cse24 .cse12) 0))) (or (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_12) 1))) (and (= (select .cse3 1) .cse4) (= (select .cse3 0) 48)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((v_arrayElimCell_60 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_9) v_arrayElimCell_60 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select v_DerPreprocessor_10 4) 0) (= (select .cse11 .cse12) 0) (= (select .cse11 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse13) (= (select v_DerPreprocessor_10 0) 0) (= .cse11 v_DerPreprocessor_9)))) .cse14 .cse15 .cse16 .cse17) (let ((.cse22 (select |c_#memory_$Pointer$.offset| .cse18)) (.cse19 (select |c_#memory_$Pointer$.base| .cse18))) (and (not (= 2 .cse18)) .cse0 (not (= 1 .cse18)) .cse1 .cse2 (< .cse18 |c_#StackHeapBarrier|) (= (select .cse19 4) 0) .cse6 .cse7 .cse8 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_6 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= .cse20 .cse21) (= .cse21 0) (= v_DerPreprocessor_7 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse18 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse18)) (= (select v_DerPreprocessor_6 .cse12) 0)))) (= (select .cse22 0) 0) .cse9 (= (select .cse22 4) 0) .cse10 .cse15 .cse16 (not .cse14) .cse17 (= (select |c_#valid| .cse18) 1) (= (select .cse19 0) 0) (= (select |c_#length| .cse18) 8))) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) 1))) (and (= .cse4 (select .cse23 1)) (= (select .cse23 0) 48)))) .cse14 .cse15 .cse16 .cse17))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) is different from true [2022-11-25 23:51:45,077 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_#NULL.offset| 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 1)) (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 2)) (= |c_#NULL.base| 0) (< |c_ULTIMATE.start_main_~list~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_main_#t~nondet9#1| 2147483647) (let ((.cse24 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse25 (select |c_#memory_int| 1)) (.cse26 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse18 (select .cse26 .cse12)) (.cse4 (select .cse25 1)) (.cse20 (select .cse26 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse13 (select .cse24 |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1)) (.cse1 (= .cse13 0)) (.cse2 (= (select |c_#valid| 0) 0)) (.cse5 (= .cse20 0)) (.cse6 (= 2 (select |c_#length| 1))) (.cse7 (= (select |c_#valid| 1) 1)) (.cse8 (= (select |c_#length| 2) 11)) (.cse9 (= (select |c_#valid| 2) 1)) (.cse10 (= .cse4 0)) (.cse14 (= 0 .cse18)) (.cse15 (= (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|) 8)) (.cse16 (= 48 (select .cse25 0))) (.cse17 (= (select .cse24 .cse12) 0))) (or (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_12 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_12) 1))) (and (= (select .cse3 1) .cse4) (= (select .cse3 0) 48)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((v_arrayElimCell_60 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_9) v_arrayElimCell_60 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select v_DerPreprocessor_10 4) 0) (= (select .cse11 .cse12) 0) (= (select .cse11 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse13) (= (select v_DerPreprocessor_10 0) 0) (= .cse11 v_DerPreprocessor_9)))) .cse14 .cse15 .cse16 .cse17) (let ((.cse22 (select |c_#memory_$Pointer$.offset| .cse18)) (.cse19 (select |c_#memory_$Pointer$.base| .cse18))) (and (not (= 2 .cse18)) .cse0 (not (= 1 .cse18)) .cse1 .cse2 (< .cse18 |c_#StackHeapBarrier|) (= (select .cse19 4) 0) .cse6 .cse7 .cse8 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_6 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= .cse20 .cse21) (= .cse21 0) (= v_DerPreprocessor_7 (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse18 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_6) .cse18)) (= (select v_DerPreprocessor_6 .cse12) 0)))) (= (select .cse22 0) 0) .cse9 (= (select .cse22 4) 0) .cse10 .cse15 .cse16 (not .cse14) .cse17 (= (select |c_#valid| .cse18) 1) (= (select .cse19 0) 0) (= (select |c_#length| .cse18) 8))) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_11) 1))) (and (= .cse4 (select .cse23 1)) (= (select .cse23 0) 48)))) .cse14 .cse15 .cse16 .cse17))))) (<= 0 (+ |c_ULTIMATE.start_main_#t~nondet9#1| 2147483648)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) is different from true [2022-11-25 23:51:45,913 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2529#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~inner~0#1.base|) (+ |ULTIMATE.start_main_~inner~0#1.offset| 4)) 0))) (= |ULTIMATE.start_main_~inner~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= |ULTIMATE.start_main_~inner~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~inner~0#1.base| 0))) (or (not (= |ULTIMATE.start_main_~end~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~end~0#1.base| 0))) (= |ULTIMATE.start_main_~len~0#1| 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_~inner~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-25 23:51:45,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:51:45,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:45,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2022-11-25 23:51:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547437953] [2022-11-25 23:51:45,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:51:45,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:51:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:45,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:51:45,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=12, NotChecked=132, Total=650 [2022-11-25 23:51:45,916 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:46,848 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-11-25 23:51:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:51:46,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 23:51:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:46,849 INFO L225 Difference]: With dead ends: 155 [2022-11-25 23:51:46,849 INFO L226 Difference]: Without dead ends: 117 [2022-11-25 23:51:46,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=12, NotChecked=168, Total=992 [2022-11-25 23:51:46,851 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 197 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:46,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 352 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:51:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-25 23:51:46,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2022-11-25 23:51:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 88 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2022-11-25 23:51:46,874 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 25 [2022-11-25 23:51:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:46,875 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2022-11-25 23:51:46,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2022-11-25 23:51:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:51:46,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:46,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:46,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:47,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:51:47,088 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash 281632313, now seen corresponding path program 1 times [2022-11-25 23:51:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:47,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020847657] [2022-11-25 23:51:47,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:47,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:47,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020847657] [2022-11-25 23:51:47,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020847657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:47,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:47,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 23:51:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489807008] [2022-11-25 23:51:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:47,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:51:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:47,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:51:47,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:51:47,987 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:48,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:48,403 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2022-11-25 23:51:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:51:48,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 23:51:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:48,405 INFO L225 Difference]: With dead ends: 185 [2022-11-25 23:51:48,405 INFO L226 Difference]: Without dead ends: 169 [2022-11-25 23:51:48,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:51:48,406 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 239 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:48,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 232 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:51:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-25 23:51:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 111. [2022-11-25 23:51:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 110 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-11-25 23:51:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2022-11-25 23:51:48,438 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 26 [2022-11-25 23:51:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:48,438 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2022-11-25 23:51:48,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-11-25 23:51:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:51:48,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:48,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:48,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:51:48,441 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:48,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1384919158, now seen corresponding path program 1 times [2022-11-25 23:51:48,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:48,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835581773] [2022-11-25 23:51:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:48,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:48,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835581773] [2022-11-25 23:51:48,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835581773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:51:48,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996547252] [2022-11-25 23:51:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:48,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:48,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:48,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:51:48,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:51:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:48,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:51:48,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:51:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:48,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:48,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996547252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:48,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [57293737] [2022-11-25 23:51:48,825 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-25 23:51:48,825 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:51:48,826 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:51:48,826 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:51:48,826 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:51:48,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:51:48,872 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:51:48,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:51:48,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:51:48,899 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-11-25 23:51:48,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-25 23:51:48,937 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:51:48,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:51:48,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 683 treesize of output 709 [2022-11-25 23:51:48,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,165 INFO L321 Elim1Store]: treesize reduction 332, result has 7.8 percent of original size [2022-11-25 23:51:49,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 340 treesize of output 363 [2022-11-25 23:51:49,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:49,239 INFO L321 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2022-11-25 23:51:49,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 176 [2022-11-25 23:51:49,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 9 [2022-11-25 23:51:49,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 9 [2022-11-25 23:51:49,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,394 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 28 treesize of output 36 [2022-11-25 23:51:49,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 17 [2022-11-25 23:51:49,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,441 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 0 case distinctions, treesize of input 17 treesize of output 11 [2022-11-25 23:51:49,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2022-11-25 23:51:49,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2022-11-25 23:51:49,630 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 13 treesize of output 9 [2022-11-25 23:51:49,680 INFO L321 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-11-25 23:51:49,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 70 [2022-11-25 23:51:49,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,692 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 0 case distinctions, treesize of input 57 treesize of output 35 [2022-11-25 23:51:49,708 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 30 treesize of output 16 [2022-11-25 23:51:49,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2022-11-25 23:51:49,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:49,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-25 23:51:49,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:49,840 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 51 treesize of output 34 [2022-11-25 23:51:51,533 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:51:53,636 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3467#(and (< 1 |ULTIMATE.start_main_~len~0#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~inner~0#1.offset| 0) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~list~0#1.offset|) (<= |#NULL.base| 0) (= |ULTIMATE.start_main_~inner~0#1.base| 0) (<= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~end~0#1.offset|))' at error location [2022-11-25 23:51:53,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:51:53,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:53,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 23:51:53,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371299197] [2022-11-25 23:51:53,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:51:53,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:51:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:53,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:51:53,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=276, Unknown=4, NotChecked=0, Total=342 [2022-11-25 23:51:53,639 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:53,768 INFO L93 Difference]: Finished difference Result 194 states and 225 transitions. [2022-11-25 23:51:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:51:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 27 [2022-11-25 23:51:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:53,769 INFO L225 Difference]: With dead ends: 194 [2022-11-25 23:51:53,770 INFO L226 Difference]: Without dead ends: 192 [2022-11-25 23:51:53,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=62, Invalid=276, Unknown=4, NotChecked=0, Total=342 [2022-11-25 23:51:53,771 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:53,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 178 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-25 23:51:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2022-11-25 23:51:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 134 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 160 transitions. [2022-11-25 23:51:53,806 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 160 transitions. Word has length 27 [2022-11-25 23:51:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:53,806 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 160 transitions. [2022-11-25 23:51:53,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2022-11-25 23:51:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 23:51:53,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:53,807 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:53,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:54,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:54,014 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:51:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1227064078, now seen corresponding path program 1 times [2022-11-25 23:51:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:54,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344426374] [2022-11-25 23:51:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:54,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:54,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344426374] [2022-11-25 23:51:54,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344426374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:51:54,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284113423] [2022-11-25 23:51:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:54,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:54,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:54,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:51:54,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:51:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:54,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 23:51:54,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:51:54,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:51:54,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:51:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:54,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:54,712 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-25 23:51:54,713 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 24 treesize of output 23 [2022-11-25 23:51:54,732 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-25 23:51:54,733 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 20 treesize of output 12 [2022-11-25 23:51:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:54,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284113423] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:54,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1336041652] [2022-11-25 23:51:54,790 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-25 23:51:54,790 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:51:54,790 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:51:54,791 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:51:54,791 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:51:54,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:51:54,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:51:54,837 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:51:54,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-25 23:51:54,876 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:51:54,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-25 23:51:54,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 23:51:54,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:54,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:54,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:55,064 INFO L321 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2022-11-25 23:51:55,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 532 treesize of output 552 [2022-11-25 23:51:55,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 423 [2022-11-25 23:51:55,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:55,161 INFO L321 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-11-25 23:51:55,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 193 [2022-11-25 23:51:55,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 9 [2022-11-25 23:51:55,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 9 [2022-11-25 23:51:55,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,363 INFO L321 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2022-11-25 23:51:55,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 67 [2022-11-25 23:51:55,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,414 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 28 treesize of output 36 [2022-11-25 23:51:55,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 17 [2022-11-25 23:51:55,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,475 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 0 case distinctions, treesize of input 17 treesize of output 11 [2022-11-25 23:51:55,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 17 [2022-11-25 23:51:55,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,583 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 0 case distinctions, treesize of input 17 treesize of output 11 [2022-11-25 23:51:55,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2022-11-25 23:51:55,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:55,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-25 23:51:55,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:55,776 INFO L321 Elim1Store]: treesize reduction 96, result has 10.3 percent of original size [2022-11-25 23:51:55,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 676 treesize of output 696 [2022-11-25 23:51:55,794 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 625 treesize of output 621 [2022-11-25 23:51:55,846 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 61 treesize of output 27 [2022-11-25 23:51:55,864 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 61 treesize of output 27 [2022-11-25 23:51:56,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:51:56,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:51:56,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:51:56,851 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:51:59,576 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4117#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))) (or (not (= |ULTIMATE.start_main_~end~0#1.offset| 0)) (not (= |ULTIMATE.start_main_~end~0#1.base| 0))) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:51:59,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:51:59,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:59,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-25 23:51:59,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214631919] [2022-11-25 23:51:59,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:51:59,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:51:59,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:51:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=553, Unknown=9, NotChecked=0, Total=702 [2022-11-25 23:51:59,578 INFO L87 Difference]: Start difference. First operand 135 states and 160 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:52:00,064 INFO L93 Difference]: Finished difference Result 283 states and 327 transitions. [2022-11-25 23:52:00,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:52:00,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 23:52:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:52:00,066 INFO L225 Difference]: With dead ends: 283 [2022-11-25 23:52:00,066 INFO L226 Difference]: Without dead ends: 257 [2022-11-25 23:52:00,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=195, Invalid=788, Unknown=9, NotChecked=0, Total=992 [2022-11-25 23:52:00,068 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 414 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:52:00,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 234 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:52:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-25 23:52:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 169. [2022-11-25 23:52:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.2317073170731707) internal successors, (202), 168 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2022-11-25 23:52:00,125 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 29 [2022-11-25 23:52:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:52:00,125 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2022-11-25 23:52:00,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2022-11-25 23:52:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 23:52:00,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:52:00,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:52:00,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:52:00,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:52:00,331 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-11-25 23:52:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:52:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 786601219, now seen corresponding path program 1 times [2022-11-25 23:52:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:52:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590964641] [2022-11-25 23:52:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:52:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:52:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:52:00,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:52:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:52:00,456 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:52:00,457 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:52:00,458 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2022-11-25 23:52:00,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2022-11-25 23:52:00,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2022-11-25 23:52:00,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2022-11-25 23:52:00,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2022-11-25 23:52:00,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2022-11-25 23:52:00,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2022-11-25 23:52:00,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2022-11-25 23:52:00,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2022-11-25 23:52:00,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2022-11-25 23:52:00,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2022-11-25 23:52:00,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2022-11-25 23:52:00,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2022-11-25 23:52:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:52:00,467 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:52:00,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:52:00,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:52:00 BoogieIcfgContainer [2022-11-25 23:52:00,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:52:00,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:52:00,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:52:00,520 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:52:00,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:51:24" (3/4) ... [2022-11-25 23:52:00,523 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 23:52:00,565 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:52:00,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:52:00,566 INFO L158 Benchmark]: Toolchain (without parser) took 37333.65ms. Allocated memory was 157.3MB in the beginning and 597.7MB in the end (delta: 440.4MB). Free memory was 115.0MB in the beginning and 456.7MB in the end (delta: -341.7MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. [2022-11-25 23:52:00,566 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:52:00,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.13ms. Allocated memory is still 157.3MB. Free memory was 115.0MB in the beginning and 94.6MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 23:52:00,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.57ms. Allocated memory is still 157.3MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:52:00,567 INFO L158 Benchmark]: Boogie Preprocessor took 42.61ms. Allocated memory is still 157.3MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:52:00,568 INFO L158 Benchmark]: RCFGBuilder took 862.95ms. Allocated memory is still 157.3MB. Free memory was 90.4MB in the beginning and 119.6MB in the end (delta: -29.2MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-11-25 23:52:00,568 INFO L158 Benchmark]: TraceAbstraction took 35700.30ms. Allocated memory was 157.3MB in the beginning and 597.7MB in the end (delta: 440.4MB). Free memory was 118.5MB in the beginning and 459.9MB in the end (delta: -341.3MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. [2022-11-25 23:52:00,568 INFO L158 Benchmark]: Witness Printer took 45.44ms. Allocated memory is still 597.7MB. Free memory was 459.9MB in the beginning and 456.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:52:00,570 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.33ms. Allocated memory is still 117.4MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.13ms. Allocated memory is still 157.3MB. Free memory was 115.0MB in the beginning and 94.6MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.57ms. Allocated memory is still 157.3MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.61ms. Allocated memory is still 157.3MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 862.95ms. Allocated memory is still 157.3MB. Free memory was 90.4MB in the beginning and 119.6MB in the end (delta: -29.2MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35700.30ms. Allocated memory was 157.3MB in the beginning and 597.7MB in the end (delta: 440.4MB). Free memory was 118.5MB in the beginning and 459.9MB in the end (delta: -341.3MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. * Witness Printer took 45.44ms. Allocated memory is still 597.7MB. Free memory was 459.9MB in the beginning and 456.7MB in the end (delta: 3.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: 1036]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={6:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={6:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={6:0}, list->inner={7:0}, list->inner={0:0}, list->inner={53:61}, list->inner={60:63}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={55:51}] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={6:0}, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={6:0}, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={6:0}, inner={7:0}, len=1, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={6:0}, inner={7:0}, len=1, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1036] EXPR inner->inner VAL [end={6:0}, inner={7:0}, inner->inner={0:0}, len=1, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={6:0}, inner={7:0}, inner->next={0:0}, len=1, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner [L1029] COND TRUE ((void*)0) != inner [L1031] COND FALSE !(len == 0) [L1034] len = 2 VAL [end={6:0}, inner={49:5}, inner->inner={52:50}, len=2, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={6:0}, inner={49:5}, inner->inner={52:50}, len=2, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1036] EXPR inner->inner VAL [end={6:0}, inner={49:5}, inner->inner={58:56}, inner->inner={52:50}, len=2, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() VAL [end={6:0}, inner={49:5}, inner->inner={52:50}, len=2, list={6:0}, list->inner={53:61}, list->inner={60:63}, malloc(sizeof(SLL))={55:51}] - UnprovableResult [Line: 1004]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1781 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1781 mSDsluCounter, 2229 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1478 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1090 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 751 mSDtfsCounter, 1090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=14, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 475 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 402 ConstructedInterpolants, 3 QuantifiedInterpolants, 4834 SizeOfPredicates, 34 NumberOfNonLiveVariables, 803 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 8/20 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-11-25 23:52:00,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bc6c7d-31a9-4c3d-8c20-163fbb51a19f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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