./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7 --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 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:22:21,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:22:21,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:22:21,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:22:21,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:22:21,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:22:21,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:22:21,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:22:21,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:22:21,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:22:21,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:22:21,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:22:21,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:22:21,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:22:21,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:22:21,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:22:21,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:22:21,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:22:21,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:22:21,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:22:21,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:22:21,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:22:21,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:22:21,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:22:21,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:22:21,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:22:21,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:22:21,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:22:21,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:22:21,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:22:21,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:22:21,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:22:21,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:22:21,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:22:21,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:22:21,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:22:21,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:22:21,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:22:21,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:22:21,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:22:21,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:22:21,414 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:22:21,461 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:22:21,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:22:21,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:22:21,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:22:21,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:22:21,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:22:21,469 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:22:21,469 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:22:21,469 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:22:21,470 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:22:21,471 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:22:21,471 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:22:21,471 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:22:21,471 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:22:21,472 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:22:21,472 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:22:21,472 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:22:21,472 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:22:21,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:22:21,474 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:22:21,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:22:21,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:22:21,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:22:21,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:22:21,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:22:21,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:22:21,477 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:22:21,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:22:21,478 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:22:21,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:22:21,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:22:21,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:22:21,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:22:21,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:22:21,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:22:21,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:22:21,480 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:22:21,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:22:21,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:22:21,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:22:21,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:22:21,481 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7 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 -> 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e [2021-11-25 20:22:21,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:22:21,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:22:21,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:22:21,742 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:22:21,743 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:22:21,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2021-11-25 20:22:21,821 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data/0c1bf7894/717a2aff408c480592db876b92c92dc9/FLAG705dc0c32 [2021-11-25 20:22:22,362 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:22:22,362 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2021-11-25 20:22:22,380 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data/0c1bf7894/717a2aff408c480592db876b92c92dc9/FLAG705dc0c32 [2021-11-25 20:22:22,663 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data/0c1bf7894/717a2aff408c480592db876b92c92dc9 [2021-11-25 20:22:22,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:22:22,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:22:22,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:22:22,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:22:22,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:22:22,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:22:22" (1/1) ... [2021-11-25 20:22:22,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8808a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:22, skipping insertion in model container [2021-11-25 20:22:22,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:22:22" (1/1) ... [2021-11-25 20:22:22,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:22:22,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:22:22,925 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 20:22:23,289 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2021-11-25 20:22:23,297 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2021-11-25 20:22:23,317 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2021-11-25 20:22:23,320 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2021-11-25 20:22:23,335 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2021-11-25 20:22:23,336 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2021-11-25 20:22:23,354 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2021-11-25 20:22:23,356 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2021-11-25 20:22:23,358 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2021-11-25 20:22:23,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:22:23,369 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:22:23,389 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 20:22:23,429 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2021-11-25 20:22:23,436 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2021-11-25 20:22:23,442 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2021-11-25 20:22:23,444 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2021-11-25 20:22:23,452 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2021-11-25 20:22:23,454 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2021-11-25 20:22:23,460 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2021-11-25 20:22:23,466 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2021-11-25 20:22:23,467 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2021-11-25 20:22:23,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:22:23,541 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:22:23,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23 WrapperNode [2021-11-25 20:22:23,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:22:23,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:22:23,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:22:23,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:22:23,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,642 INFO L137 Inliner]: procedures = 278, calls = 103, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 416 [2021-11-25 20:22:23,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:22:23,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:22:23,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:22:23,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:22:23,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:22:23,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:22:23,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:22:23,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:22:23,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (1/1) ... [2021-11-25 20:22:23,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:22:23,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:22:23,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:22:23,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:22:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2021-11-25 20:22:23,837 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2021-11-25 20:22:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:22:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 20:22:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:22:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 20:22:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 20:22:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 20:22:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:22:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 20:22:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:22:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:22:23,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:22:23,842 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:22:24,047 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:22:24,062 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:22:24,686 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:22:24,697 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:22:24,697 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-25 20:22:24,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:22:24 BoogieIcfgContainer [2021-11-25 20:22:24,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:22:24,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:22:24,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:22:24,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:22:24,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:22:22" (1/3) ... [2021-11-25 20:22:24,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afdb002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:22:24, skipping insertion in model container [2021-11-25 20:22:24,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:22:23" (2/3) ... [2021-11-25 20:22:24,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afdb002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:22:24, skipping insertion in model container [2021-11-25 20:22:24,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:22:24" (3/3) ... [2021-11-25 20:22:24,708 INFO L111 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2021-11-25 20:22:24,713 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:22:24,713 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:22:24,713 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-25 20:22:24,713 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:22:24,761 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,761 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,762 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,762 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,762 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,762 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,762 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,763 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,764 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,764 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,764 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,764 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,764 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,765 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,765 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,765 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,765 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,767 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,767 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,767 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,767 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,767 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,769 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,769 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,769 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,769 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,769 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,770 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,770 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,770 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,770 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,770 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,771 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,771 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,771 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,771 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,771 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,776 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,776 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,776 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,776 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,776 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,784 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,785 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,785 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,785 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,785 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,785 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,786 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,787 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,797 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,798 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,799 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,800 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,801 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,802 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,802 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,802 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,802 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,802 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,803 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,804 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,805 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,806 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,807 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,807 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,807 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,807 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,807 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,808 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,809 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,809 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,809 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,809 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,809 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,810 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,810 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,810 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,810 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,810 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,811 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,812 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,812 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,812 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,812 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,812 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,812 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,813 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,813 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,813 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,813 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,813 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,814 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,815 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,816 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,816 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,816 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,816 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,816 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,816 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,817 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,817 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,817 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,817 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,817 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,818 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,819 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,820 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,820 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,820 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,820 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,820 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,821 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,822 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,822 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,822 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,822 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,822 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,823 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,824 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,825 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,826 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,827 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,827 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,827 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,827 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,827 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,827 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,828 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,828 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,828 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,828 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,828 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,829 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,829 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,829 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,829 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,829 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,829 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,830 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,830 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,830 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,830 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,830 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,831 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,831 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,831 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,831 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,831 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,832 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,832 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,832 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,832 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,832 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,833 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,833 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,833 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,833 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,833 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,833 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,834 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,834 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,834 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,834 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,834 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,835 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,835 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,835 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,835 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,835 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,835 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,836 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,836 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,836 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,839 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,839 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,839 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,840 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,840 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,840 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,840 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,840 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,841 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,841 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,841 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,841 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,841 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,842 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,842 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,842 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,842 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,842 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,842 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,843 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,843 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,843 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,843 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,843 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,844 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,844 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,844 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,844 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,844 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,845 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,845 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,845 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,845 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,845 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,846 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,846 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,846 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,846 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,846 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,847 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,847 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,847 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,847 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,847 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:22:24,851 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-11-25 20:22:24,895 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:22:24,901 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:22:24,902 INFO L340 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-11-25 20:22:24,922 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:22:24,934 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 478 places, 507 transitions, 1022 flow [2021-11-25 20:22:24,937 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 478 places, 507 transitions, 1022 flow [2021-11-25 20:22:24,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 478 places, 507 transitions, 1022 flow [2021-11-25 20:22:25,150 INFO L129 PetriNetUnfolder]: 33/506 cut-off events. [2021-11-25 20:22:25,151 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-25 20:22:25,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 506 events. 33/506 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1168 event pairs, 0 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 352. Up to 3 conditions per place. [2021-11-25 20:22:25,190 INFO L116 LiptonReduction]: Number of co-enabled transitions 36864 [2021-11-25 20:22:58,583 WARN L227 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 235 DAG size of output: 220 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:23:06,452 WARN L227 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 241 DAG size of output: 226 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-25 20:23:09,241 INFO L131 LiptonReduction]: Checked pairs total: 142414 [2021-11-25 20:23:09,242 INFO L133 LiptonReduction]: Total number of compositions: 546 [2021-11-25 20:23:09,253 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 123 transitions, 254 flow [2021-11-25 20:23:09,342 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1451 states, 1440 states have (on average 2.327777777777778) internal successors, (3352), 1450 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 1451 states, 1440 states have (on average 2.327777777777778) internal successors, (3352), 1450 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-11-25 20:23:09,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:09,354 INFO L514 BasicCegarLoop]: trace histogram [1] [2021-11-25 20:23:09,357 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1791, now seen corresponding path program 1 times [2021-11-25 20:23:09,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:09,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124461054] [2021-11-25 20:23:09,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:09,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:09,511 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:09,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124461054] [2021-11-25 20:23:09,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124461054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:09,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:09,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-11-25 20:23:09,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137021249] [2021-11-25 20:23:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:09,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 20:23:09,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:09,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 20:23:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:23:09,555 INFO L87 Difference]: Start difference. First operand has 1451 states, 1440 states have (on average 2.327777777777778) internal successors, (3352), 1450 states have internal predecessors, (3352), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:09,773 INFO L93 Difference]: Finished difference Result 1450 states and 3256 transitions. [2021-11-25 20:23:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 20:23:09,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2021-11-25 20:23:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:09,805 INFO L225 Difference]: With dead ends: 1450 [2021-11-25 20:23:09,805 INFO L226 Difference]: Without dead ends: 1450 [2021-11-25 20:23:09,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:23:09,814 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:09,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:23:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2021-11-25 20:23:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2021-11-25 20:23:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1440 states have (on average 2.261111111111111) internal successors, (3256), 1449 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 3256 transitions. [2021-11-25 20:23:09,999 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 3256 transitions. Word has length 1 [2021-11-25 20:23:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:10,000 INFO L470 AbstractCegarLoop]: Abstraction has 1450 states and 3256 transitions. [2021-11-25 20:23:10,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 3256 transitions. [2021-11-25 20:23:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 20:23:10,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:10,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 20:23:10,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:23:10,002 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash 946258214, now seen corresponding path program 1 times [2021-11-25 20:23:10,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:10,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215719273] [2021-11-25 20:23:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:10,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:10,256 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:10,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215719273] [2021-11-25 20:23:10,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215719273] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:10,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:10,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:23:10,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316851841] [2021-11-25 20:23:10,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:10,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:23:10,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:10,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:23:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:23:10,259 INFO L87 Difference]: Start difference. First operand 1450 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:10,596 INFO L93 Difference]: Finished difference Result 2723 states and 6126 transitions. [2021-11-25 20:23:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:23:10,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-25 20:23:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:10,621 INFO L225 Difference]: With dead ends: 2723 [2021-11-25 20:23:10,621 INFO L226 Difference]: Without dead ends: 2723 [2021-11-25 20:23:10,621 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:23:10,623 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 97 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:10,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 48 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:23:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2021-11-25 20:23:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 1469. [2021-11-25 20:23:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1459 states have (on average 2.259081562714188) internal successors, (3296), 1468 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3296 transitions. [2021-11-25 20:23:10,694 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3296 transitions. Word has length 6 [2021-11-25 20:23:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:10,694 INFO L470 AbstractCegarLoop]: Abstraction has 1469 states and 3296 transitions. [2021-11-25 20:23:10,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3296 transitions. [2021-11-25 20:23:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 20:23:10,696 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:10,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:10,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:23:10,696 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -729302322, now seen corresponding path program 1 times [2021-11-25 20:23:10,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568898469] [2021-11-25 20:23:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:10,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:10,774 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:10,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568898469] [2021-11-25 20:23:10,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568898469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:10,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:10,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:23:10,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337955370] [2021-11-25 20:23:10,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:10,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:23:10,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:10,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:23:10,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:23:10,776 INFO L87 Difference]: Start difference. First operand 1469 states and 3296 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) [2021-11-25 20:23:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:10,971 INFO L93 Difference]: Finished difference Result 1469 states and 3277 transitions. [2021-11-25 20:23:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:23:10,972 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 [2021-11-25 20:23:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:10,982 INFO L225 Difference]: With dead ends: 1469 [2021-11-25 20:23:10,983 INFO L226 Difference]: Without dead ends: 1469 [2021-11-25 20:23:10,983 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:23:10,984 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:10,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 27 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:23:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2021-11-25 20:23:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2021-11-25 20:23:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1459 states have (on average 2.246058944482522) internal successors, (3277), 1468 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3277 transitions. [2021-11-25 20:23:11,034 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3277 transitions. Word has length 7 [2021-11-25 20:23:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:11,035 INFO L470 AbstractCegarLoop]: Abstraction has 1469 states and 3277 transitions. [2021-11-25 20:23:11,035 INFO L471 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) [2021-11-25 20:23:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3277 transitions. [2021-11-25 20:23:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 20:23:11,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:11,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:11,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:23:11,037 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1122511823, now seen corresponding path program 1 times [2021-11-25 20:23:11,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:11,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609051615] [2021-11-25 20:23:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:11,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:11,231 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:11,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609051615] [2021-11-25 20:23:11,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609051615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:11,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:11,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:23:11,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933446721] [2021-11-25 20:23:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:11,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:23:11,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:23:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:23:11,234 INFO L87 Difference]: Start difference. First operand 1469 states and 3277 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:11,883 INFO L93 Difference]: Finished difference Result 1855 states and 4138 transitions. [2021-11-25 20:23:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:23:11,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-25 20:23:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:11,899 INFO L225 Difference]: With dead ends: 1855 [2021-11-25 20:23:11,899 INFO L226 Difference]: Without dead ends: 1855 [2021-11-25 20:23:11,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:23:11,906 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 127 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:11,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 25 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 20:23:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2021-11-25 20:23:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1576. [2021-11-25 20:23:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1566 states have (on average 2.2490421455938696) internal successors, (3522), 1575 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3522 transitions. [2021-11-25 20:23:11,966 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3522 transitions. Word has length 8 [2021-11-25 20:23:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:11,966 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 3522 transitions. [2021-11-25 20:23:11,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3522 transitions. [2021-11-25 20:23:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 20:23:11,971 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:11,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:11,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:23:11,975 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash -696730677, now seen corresponding path program 1 times [2021-11-25 20:23:11,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:11,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35377455] [2021-11-25 20:23:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:11,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:12,126 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:12,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35377455] [2021-11-25 20:23:12,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35377455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:12,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:12,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:23:12,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234205670] [2021-11-25 20:23:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:12,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:23:12,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:12,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:23:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:23:12,128 INFO L87 Difference]: Start difference. First operand 1576 states and 3522 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:12,406 INFO L93 Difference]: Finished difference Result 2584 states and 5768 transitions. [2021-11-25 20:23:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:23:12,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-25 20:23:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:12,425 INFO L225 Difference]: With dead ends: 2584 [2021-11-25 20:23:12,425 INFO L226 Difference]: Without dead ends: 2584 [2021-11-25 20:23:12,426 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:23:12,427 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 73 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:12,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 48 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:23:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2021-11-25 20:23:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 1633. [2021-11-25 20:23:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1623 states have (on average 2.243992606284658) internal successors, (3642), 1632 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 3642 transitions. [2021-11-25 20:23:12,518 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 3642 transitions. Word has length 10 [2021-11-25 20:23:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:12,518 INFO L470 AbstractCegarLoop]: Abstraction has 1633 states and 3642 transitions. [2021-11-25 20:23:12,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 3642 transitions. [2021-11-25 20:23:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 20:23:12,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:12,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:12,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 20:23:12,521 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:12,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash 344091785, now seen corresponding path program 1 times [2021-11-25 20:23:12,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:12,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811040860] [2021-11-25 20:23:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:12,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:12,726 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:12,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811040860] [2021-11-25 20:23:12,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811040860] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:12,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:12,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:23:12,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663308267] [2021-11-25 20:23:12,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:12,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:23:12,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:23:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:23:12,728 INFO L87 Difference]: Start difference. First operand 1633 states and 3642 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:14,209 INFO L93 Difference]: Finished difference Result 2374 states and 5281 transitions. [2021-11-25 20:23:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:23:14,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-25 20:23:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:14,225 INFO L225 Difference]: With dead ends: 2374 [2021-11-25 20:23:14,225 INFO L226 Difference]: Without dead ends: 2374 [2021-11-25 20:23:14,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2021-11-25 20:23:14,226 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 387 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:14,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 24 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 20:23:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2021-11-25 20:23:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1647. [2021-11-25 20:23:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1637 states have (on average 2.244349419670128) internal successors, (3674), 1646 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3674 transitions. [2021-11-25 20:23:14,281 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3674 transitions. Word has length 14 [2021-11-25 20:23:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:14,282 INFO L470 AbstractCegarLoop]: Abstraction has 1647 states and 3674 transitions. [2021-11-25 20:23:14,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3674 transitions. [2021-11-25 20:23:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 20:23:14,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:14,284 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:14,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 20:23:14,284 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2033711913, now seen corresponding path program 1 times [2021-11-25 20:23:14,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:14,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549875781] [2021-11-25 20:23:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:14,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:14,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:14,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549875781] [2021-11-25 20:23:14,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549875781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:14,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:14,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 20:23:14,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608225851] [2021-11-25 20:23:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:14,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:23:14,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:23:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:23:14,410 INFO L87 Difference]: Start difference. First operand 1647 states and 3674 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:15,284 INFO L93 Difference]: Finished difference Result 2628 states and 5857 transitions. [2021-11-25 20:23:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:23:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-25 20:23:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:15,301 INFO L225 Difference]: With dead ends: 2628 [2021-11-25 20:23:15,301 INFO L226 Difference]: Without dead ends: 2591 [2021-11-25 20:23:15,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:23:15,302 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 120 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:15,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 27 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 20:23:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2021-11-25 20:23:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 1932. [2021-11-25 20:23:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1922 states have (on average 2.27471383975026) internal successors, (4372), 1931 states have internal predecessors, (4372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 4372 transitions. [2021-11-25 20:23:15,391 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 4372 transitions. Word has length 14 [2021-11-25 20:23:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:15,392 INFO L470 AbstractCegarLoop]: Abstraction has 1932 states and 4372 transitions. [2021-11-25 20:23:15,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 4372 transitions. [2021-11-25 20:23:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 20:23:15,393 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:15,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:15,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 20:23:15,394 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:15,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1608731715, now seen corresponding path program 2 times [2021-11-25 20:23:15,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:15,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122801541] [2021-11-25 20:23:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:15,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:15,591 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122801541] [2021-11-25 20:23:15,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122801541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:15,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:15,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:23:15,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240599212] [2021-11-25 20:23:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:15,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:23:15,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:23:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:23:15,593 INFO L87 Difference]: Start difference. First operand 1932 states and 4372 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:17,514 INFO L93 Difference]: Finished difference Result 2390 states and 5367 transitions. [2021-11-25 20:23:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 20:23:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-25 20:23:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:17,530 INFO L225 Difference]: With dead ends: 2390 [2021-11-25 20:23:17,530 INFO L226 Difference]: Without dead ends: 2390 [2021-11-25 20:23:17,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2021-11-25 20:23:17,532 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 470 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:17,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 22 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 20:23:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2021-11-25 20:23:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 1920. [2021-11-25 20:23:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1910 states have (on average 2.2743455497382197) internal successors, (4344), 1919 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 4344 transitions. [2021-11-25 20:23:17,595 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 4344 transitions. Word has length 14 [2021-11-25 20:23:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:17,595 INFO L470 AbstractCegarLoop]: Abstraction has 1920 states and 4344 transitions. [2021-11-25 20:23:17,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 4344 transitions. [2021-11-25 20:23:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:17,597 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:17,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:17,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 20:23:17,598 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2076579246, now seen corresponding path program 1 times [2021-11-25 20:23:17,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:17,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943396051] [2021-11-25 20:23:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:17,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:17,876 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:17,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943396051] [2021-11-25 20:23:17,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943396051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:17,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:17,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:23:17,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921950352] [2021-11-25 20:23:17,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:17,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:23:17,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:17,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:23:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:23:17,880 INFO L87 Difference]: Start difference. First operand 1920 states and 4344 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:19,678 INFO L93 Difference]: Finished difference Result 3079 states and 6905 transitions. [2021-11-25 20:23:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 20:23:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:19,697 INFO L225 Difference]: With dead ends: 3079 [2021-11-25 20:23:19,697 INFO L226 Difference]: Without dead ends: 3079 [2021-11-25 20:23:19,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=434, Unknown=0, NotChecked=0, Total=650 [2021-11-25 20:23:19,699 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 492 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:19,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 24 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 20:23:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2021-11-25 20:23:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 1982. [2021-11-25 20:23:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1972 states have (on average 2.2758620689655173) internal successors, (4488), 1981 states have internal predecessors, (4488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4488 transitions. [2021-11-25 20:23:19,799 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4488 transitions. Word has length 15 [2021-11-25 20:23:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:19,801 INFO L470 AbstractCegarLoop]: Abstraction has 1982 states and 4488 transitions. [2021-11-25 20:23:19,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4488 transitions. [2021-11-25 20:23:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:19,804 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:19,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:19,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 20:23:19,804 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1137616898, now seen corresponding path program 1 times [2021-11-25 20:23:19,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:19,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303574357] [2021-11-25 20:23:19,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:19,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:20,137 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:20,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303574357] [2021-11-25 20:23:20,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303574357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:20,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:20,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:23:20,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534957309] [2021-11-25 20:23:20,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:20,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:23:20,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:23:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:23:20,139 INFO L87 Difference]: Start difference. First operand 1982 states and 4488 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:21,355 INFO L93 Difference]: Finished difference Result 2813 states and 6331 transitions. [2021-11-25 20:23:21,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:23:21,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:21,362 INFO L225 Difference]: With dead ends: 2813 [2021-11-25 20:23:21,362 INFO L226 Difference]: Without dead ends: 2813 [2021-11-25 20:23:21,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:23:21,363 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 213 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:21,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 24 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 20:23:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2021-11-25 20:23:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2138. [2021-11-25 20:23:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 2128 states have (on average 2.2843045112781954) internal successors, (4861), 2137 states have internal predecessors, (4861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 4861 transitions. [2021-11-25 20:23:21,430 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 4861 transitions. Word has length 15 [2021-11-25 20:23:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:21,431 INFO L470 AbstractCegarLoop]: Abstraction has 2138 states and 4861 transitions. [2021-11-25 20:23:21,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 4861 transitions. [2021-11-25 20:23:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:21,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:21,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:21,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 20:23:21,433 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1658931202, now seen corresponding path program 2 times [2021-11-25 20:23:21,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:21,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600979906] [2021-11-25 20:23:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:21,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:21,818 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:21,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600979906] [2021-11-25 20:23:21,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600979906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:21,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:21,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:23:21,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771818278] [2021-11-25 20:23:21,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:21,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:23:21,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:21,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:23:21,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:23:21,820 INFO L87 Difference]: Start difference. First operand 2138 states and 4861 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:23,432 INFO L93 Difference]: Finished difference Result 2736 states and 6105 transitions. [2021-11-25 20:23:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 20:23:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:23,456 INFO L225 Difference]: With dead ends: 2736 [2021-11-25 20:23:23,456 INFO L226 Difference]: Without dead ends: 2736 [2021-11-25 20:23:23,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-11-25 20:23:23,457 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 322 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:23,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 24 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 20:23:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2021-11-25 20:23:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1961. [2021-11-25 20:23:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1951 states have (on average 2.266017426960533) internal successors, (4421), 1960 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 4421 transitions. [2021-11-25 20:23:23,515 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 4421 transitions. Word has length 15 [2021-11-25 20:23:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:23,515 INFO L470 AbstractCegarLoop]: Abstraction has 1961 states and 4421 transitions. [2021-11-25 20:23:23,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 4421 transitions. [2021-11-25 20:23:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:23,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:23,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:23,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 20:23:23,517 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2109978108, now seen corresponding path program 3 times [2021-11-25 20:23:23,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:23,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411145976] [2021-11-25 20:23:23,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:23,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:23,871 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411145976] [2021-11-25 20:23:23,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411145976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:23,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:23,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:23:23,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022609103] [2021-11-25 20:23:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:23,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:23:23,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:23,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:23:23,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:23:23,873 INFO L87 Difference]: Start difference. First operand 1961 states and 4421 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:26,680 INFO L93 Difference]: Finished difference Result 2718 states and 6073 transitions. [2021-11-25 20:23:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 20:23:26,681 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:26,687 INFO L225 Difference]: With dead ends: 2718 [2021-11-25 20:23:26,687 INFO L226 Difference]: Without dead ends: 2718 [2021-11-25 20:23:26,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=731, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 20:23:26,689 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 493 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:26,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 35 Invalid, 2550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2510 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 20:23:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2021-11-25 20:23:26,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2005. [2021-11-25 20:23:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1995 states have (on average 2.2711779448621554) internal successors, (4531), 2004 states have internal predecessors, (4531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 4531 transitions. [2021-11-25 20:23:26,750 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 4531 transitions. Word has length 15 [2021-11-25 20:23:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:26,750 INFO L470 AbstractCegarLoop]: Abstraction has 2005 states and 4531 transitions. [2021-11-25 20:23:26,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 4531 transitions. [2021-11-25 20:23:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:26,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:26,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:26,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 20:23:26,753 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1589137872, now seen corresponding path program 4 times [2021-11-25 20:23:26,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:26,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681575547] [2021-11-25 20:23:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:26,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:27,066 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:27,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681575547] [2021-11-25 20:23:27,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681575547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:27,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:27,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:23:27,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593549814] [2021-11-25 20:23:27,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:27,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:23:27,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:23:27,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:23:27,068 INFO L87 Difference]: Start difference. First operand 2005 states and 4531 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:30,662 INFO L93 Difference]: Finished difference Result 2696 states and 6047 transitions. [2021-11-25 20:23:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 20:23:30,662 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:30,668 INFO L225 Difference]: With dead ends: 2696 [2021-11-25 20:23:30,669 INFO L226 Difference]: Without dead ends: 2696 [2021-11-25 20:23:30,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 20:23:30,670 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 391 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 3631 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:30,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 35 Invalid, 3669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3631 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:23:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2021-11-25 20:23:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2005. [2021-11-25 20:23:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1995 states have (on average 2.2711779448621554) internal successors, (4531), 2004 states have internal predecessors, (4531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 4531 transitions. [2021-11-25 20:23:30,726 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 4531 transitions. Word has length 15 [2021-11-25 20:23:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:30,727 INFO L470 AbstractCegarLoop]: Abstraction has 2005 states and 4531 transitions. [2021-11-25 20:23:30,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 4531 transitions. [2021-11-25 20:23:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:30,728 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:30,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:30,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 20:23:30,729 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:30,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1218008820, now seen corresponding path program 2 times [2021-11-25 20:23:30,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:30,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347216949] [2021-11-25 20:23:30,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:30,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:30,923 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:30,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347216949] [2021-11-25 20:23:30,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347216949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:30,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:30,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:23:30,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567370076] [2021-11-25 20:23:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:30,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:23:30,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:23:30,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:23:30,925 INFO L87 Difference]: Start difference. First operand 2005 states and 4531 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:32,645 INFO L93 Difference]: Finished difference Result 2576 states and 5762 transitions. [2021-11-25 20:23:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 20:23:32,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:32,657 INFO L225 Difference]: With dead ends: 2576 [2021-11-25 20:23:32,658 INFO L226 Difference]: Without dead ends: 2576 [2021-11-25 20:23:32,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2021-11-25 20:23:32,659 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 503 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:32,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 22 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 20:23:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2021-11-25 20:23:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1997. [2021-11-25 20:23:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1987 states have (on average 2.2712632108706594) internal successors, (4513), 1996 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 4513 transitions. [2021-11-25 20:23:32,721 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 4513 transitions. Word has length 15 [2021-11-25 20:23:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:32,722 INFO L470 AbstractCegarLoop]: Abstraction has 1997 states and 4513 transitions. [2021-11-25 20:23:32,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 4513 transitions. [2021-11-25 20:23:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:32,723 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:32,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:32,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 20:23:32,724 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1157488478, now seen corresponding path program 3 times [2021-11-25 20:23:32,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:32,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830075419] [2021-11-25 20:23:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:32,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:32,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:32,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830075419] [2021-11-25 20:23:32,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830075419] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:32,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:32,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:23:32,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960235932] [2021-11-25 20:23:32,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:32,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:23:32,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:32,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:23:32,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:23:32,896 INFO L87 Difference]: Start difference. First operand 1997 states and 4513 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:34,373 INFO L93 Difference]: Finished difference Result 2613 states and 5846 transitions. [2021-11-25 20:23:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 20:23:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:34,392 INFO L225 Difference]: With dead ends: 2613 [2021-11-25 20:23:34,392 INFO L226 Difference]: Without dead ends: 2613 [2021-11-25 20:23:34,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=432, Unknown=0, NotChecked=0, Total=650 [2021-11-25 20:23:34,393 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 631 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:34,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 22 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 20:23:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2021-11-25 20:23:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2017. [2021-11-25 20:23:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 2007 states have (on average 2.2705530642750373) internal successors, (4557), 2016 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 4557 transitions. [2021-11-25 20:23:34,441 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 4557 transitions. Word has length 15 [2021-11-25 20:23:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:34,442 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 4557 transitions. [2021-11-25 20:23:34,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 4557 transitions. [2021-11-25 20:23:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:34,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:34,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:34,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 20:23:34,444 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2097695960, now seen corresponding path program 4 times [2021-11-25 20:23:34,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:34,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261105343] [2021-11-25 20:23:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:34,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:34,675 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:34,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261105343] [2021-11-25 20:23:34,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261105343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:34,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:34,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 20:23:34,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441873353] [2021-11-25 20:23:34,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:34,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:23:34,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:34,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:23:34,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:23:34,677 INFO L87 Difference]: Start difference. First operand 2017 states and 4557 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:36,537 INFO L93 Difference]: Finished difference Result 2639 states and 5898 transitions. [2021-11-25 20:23:36,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 20:23:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:36,543 INFO L225 Difference]: With dead ends: 2639 [2021-11-25 20:23:36,543 INFO L226 Difference]: Without dead ends: 2639 [2021-11-25 20:23:36,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=512, Unknown=0, NotChecked=0, Total=756 [2021-11-25 20:23:36,544 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 622 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:36,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [622 Valid, 22 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 20:23:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2021-11-25 20:23:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 1989. [2021-11-25 20:23:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1979 states have (on average 2.2703385548256696) internal successors, (4493), 1988 states have internal predecessors, (4493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 4493 transitions. [2021-11-25 20:23:36,618 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 4493 transitions. Word has length 15 [2021-11-25 20:23:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:36,619 INFO L470 AbstractCegarLoop]: Abstraction has 1989 states and 4493 transitions. [2021-11-25 20:23:36,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 4493 transitions. [2021-11-25 20:23:36,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:36,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:36,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:36,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 20:23:36,621 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:36,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:36,621 INFO L85 PathProgramCache]: Analyzing trace with hash -608276146, now seen corresponding path program 5 times [2021-11-25 20:23:36,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:36,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004807453] [2021-11-25 20:23:36,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:36,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:36,927 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:36,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004807453] [2021-11-25 20:23:36,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004807453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:36,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:36,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:23:36,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091327098] [2021-11-25 20:23:36,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:36,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:23:36,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:36,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:23:36,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:23:36,929 INFO L87 Difference]: Start difference. First operand 1989 states and 4493 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:40,258 INFO L93 Difference]: Finished difference Result 2535 states and 5671 transitions. [2021-11-25 20:23:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:23:40,259 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:40,262 INFO L225 Difference]: With dead ends: 2535 [2021-11-25 20:23:40,262 INFO L226 Difference]: Without dead ends: 2535 [2021-11-25 20:23:40,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=452, Invalid=1108, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 20:23:40,263 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 432 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 3114 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:40,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 35 Invalid, 3154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3114 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:23:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2021-11-25 20:23:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 1989. [2021-11-25 20:23:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1979 states have (on average 2.2703385548256696) internal successors, (4493), 1988 states have internal predecessors, (4493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 4493 transitions. [2021-11-25 20:23:40,309 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 4493 transitions. Word has length 15 [2021-11-25 20:23:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:40,309 INFO L470 AbstractCegarLoop]: Abstraction has 1989 states and 4493 transitions. [2021-11-25 20:23:40,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 4493 transitions. [2021-11-25 20:23:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:40,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:40,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:40,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 20:23:40,311 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:40,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:40,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1652178058, now seen corresponding path program 6 times [2021-11-25 20:23:40,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:40,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851507697] [2021-11-25 20:23:40,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:40,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:40,580 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:40,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851507697] [2021-11-25 20:23:40,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851507697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:40,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:40,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:23:40,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417149747] [2021-11-25 20:23:40,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:40,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:23:40,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:40,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:23:40,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:23:40,582 INFO L87 Difference]: Start difference. First operand 1989 states and 4493 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:43,742 INFO L93 Difference]: Finished difference Result 2493 states and 5584 transitions. [2021-11-25 20:23:43,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:23:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:43,745 INFO L225 Difference]: With dead ends: 2493 [2021-11-25 20:23:43,746 INFO L226 Difference]: Without dead ends: 2493 [2021-11-25 20:23:43,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=471, Invalid=1169, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:23:43,747 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 442 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:43,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 35 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 20:23:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2021-11-25 20:23:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1993. [2021-11-25 20:23:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1983 states have (on average 2.269793242561775) internal successors, (4501), 1992 states have internal predecessors, (4501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4501 transitions. [2021-11-25 20:23:43,790 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4501 transitions. Word has length 15 [2021-11-25 20:23:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:43,790 INFO L470 AbstractCegarLoop]: Abstraction has 1993 states and 4501 transitions. [2021-11-25 20:23:43,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4501 transitions. [2021-11-25 20:23:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:43,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:43,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:43,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 20:23:43,792 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:43,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 293412896, now seen corresponding path program 7 times [2021-11-25 20:23:43,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:43,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731454021] [2021-11-25 20:23:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:43,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:44,050 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:44,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731454021] [2021-11-25 20:23:44,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731454021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:44,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:44,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:23:44,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675745712] [2021-11-25 20:23:44,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:44,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:23:44,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:44,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:23:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:23:44,051 INFO L87 Difference]: Start difference. First operand 1993 states and 4501 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:47,365 INFO L93 Difference]: Finished difference Result 2467 states and 5529 transitions. [2021-11-25 20:23:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 20:23:47,366 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:47,368 INFO L225 Difference]: With dead ends: 2467 [2021-11-25 20:23:47,368 INFO L226 Difference]: Without dead ends: 2467 [2021-11-25 20:23:47,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=469, Invalid=1171, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:23:47,369 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 433 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:47,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 35 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:23:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2021-11-25 20:23:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 1993. [2021-11-25 20:23:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1983 states have (on average 2.269793242561775) internal successors, (4501), 1992 states have internal predecessors, (4501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4501 transitions. [2021-11-25 20:23:47,410 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4501 transitions. Word has length 15 [2021-11-25 20:23:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:47,410 INFO L470 AbstractCegarLoop]: Abstraction has 1993 states and 4501 transitions. [2021-11-25 20:23:47,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4501 transitions. [2021-11-25 20:23:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:47,412 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:47,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:47,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 20:23:47,412 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1087560822, now seen corresponding path program 8 times [2021-11-25 20:23:47,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:47,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637105794] [2021-11-25 20:23:47,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:47,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:47,684 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:47,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637105794] [2021-11-25 20:23:47,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637105794] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:47,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:47,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:23:47,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447353322] [2021-11-25 20:23:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:47,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:23:47,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:23:47,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:23:47,686 INFO L87 Difference]: Start difference. First operand 1993 states and 4501 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:51,495 INFO L93 Difference]: Finished difference Result 2783 states and 6226 transitions. [2021-11-25 20:23:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 20:23:51,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:51,499 INFO L225 Difference]: With dead ends: 2783 [2021-11-25 20:23:51,499 INFO L226 Difference]: Without dead ends: 2783 [2021-11-25 20:23:51,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=510, Invalid=1212, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 20:23:51,500 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 502 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 2973 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:51,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 35 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2973 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 20:23:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2021-11-25 20:23:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 1993. [2021-11-25 20:23:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1983 states have (on average 2.269793242561775) internal successors, (4501), 1992 states have internal predecessors, (4501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4501 transitions. [2021-11-25 20:23:51,545 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4501 transitions. Word has length 15 [2021-11-25 20:23:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:51,545 INFO L470 AbstractCegarLoop]: Abstraction has 1993 states and 4501 transitions. [2021-11-25 20:23:51,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4501 transitions. [2021-11-25 20:23:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:23:51,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:51,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:51,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-25 20:23:51,547 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -495046284, now seen corresponding path program 9 times [2021-11-25 20:23:51,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087412581] [2021-11-25 20:23:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:51,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:51,826 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:51,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087412581] [2021-11-25 20:23:51,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087412581] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:51,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:51,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:23:51,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698592879] [2021-11-25 20:23:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:51,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:23:51,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:23:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:23:51,828 INFO L87 Difference]: Start difference. First operand 1993 states and 4501 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:55,218 INFO L93 Difference]: Finished difference Result 2957 states and 6602 transitions. [2021-11-25 20:23:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 20:23:55,219 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:23:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:55,222 INFO L225 Difference]: With dead ends: 2957 [2021-11-25 20:23:55,222 INFO L226 Difference]: Without dead ends: 2957 [2021-11-25 20:23:55,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=409, Invalid=923, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 20:23:55,223 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 441 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 3381 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:55,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 35 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3381 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 20:23:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2021-11-25 20:23:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1949. [2021-11-25 20:23:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1939 states have (on average 2.264569365652398) internal successors, (4391), 1948 states have internal predecessors, (4391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 4391 transitions. [2021-11-25 20:23:55,270 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 4391 transitions. Word has length 15 [2021-11-25 20:23:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:55,270 INFO L470 AbstractCegarLoop]: Abstraction has 1949 states and 4391 transitions. [2021-11-25 20:23:55,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 4391 transitions. [2021-11-25 20:23:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:23:55,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:55,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:55,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 20:23:55,272 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:55,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1065326767, now seen corresponding path program 1 times [2021-11-25 20:23:55,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:55,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599665795] [2021-11-25 20:23:55,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:55,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:55,747 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:55,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599665795] [2021-11-25 20:23:55,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599665795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:55,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:55,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:23:55,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024906202] [2021-11-25 20:23:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:55,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:23:55,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:23:55,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:23:55,749 INFO L87 Difference]: Start difference. First operand 1949 states and 4391 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:23:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:23:58,519 INFO L93 Difference]: Finished difference Result 3414 states and 7661 transitions. [2021-11-25 20:23:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 20:23:58,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 [2021-11-25 20:23:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:23:58,524 INFO L225 Difference]: With dead ends: 3414 [2021-11-25 20:23:58,524 INFO L226 Difference]: Without dead ends: 3414 [2021-11-25 20:23:58,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2021-11-25 20:23:58,525 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 616 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:23:58,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 35 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 20:23:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2021-11-25 20:23:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 2188. [2021-11-25 20:23:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 2178 states have (on average 2.2887970615243343) internal successors, (4985), 2187 states have internal predecessors, (4985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:23:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 4985 transitions. [2021-11-25 20:23:58,574 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 4985 transitions. Word has length 17 [2021-11-25 20:23:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:23:58,574 INFO L470 AbstractCegarLoop]: Abstraction has 2188 states and 4985 transitions. [2021-11-25 20:23:58,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:23:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 4985 transitions. [2021-11-25 20:23:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:23:58,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:23:58,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:23:58,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-25 20:23:58,577 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:23:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:23:58,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1079395807, now seen corresponding path program 2 times [2021-11-25 20:23:58,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:23:58,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703868710] [2021-11-25 20:23:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:23:58,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:23:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:23:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:23:59,734 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:23:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703868710] [2021-11-25 20:23:59,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703868710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:23:59,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:23:59,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:23:59,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925156489] [2021-11-25 20:23:59,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:23:59,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:23:59,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:23:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:23:59,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:23:59,736 INFO L87 Difference]: Start difference. First operand 2188 states and 4985 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) [2021-11-25 20:24:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:04,436 INFO L93 Difference]: Finished difference Result 4422 states and 9983 transitions. [2021-11-25 20:24:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 20:24:04,437 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 [2021-11-25 20:24:04,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:04,442 INFO L225 Difference]: With dead ends: 4422 [2021-11-25 20:24:04,442 INFO L226 Difference]: Without dead ends: 4422 [2021-11-25 20:24:04,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=501, Invalid=1661, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 20:24:04,443 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 710 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:04,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [710 Valid, 24 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 20:24:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2021-11-25 20:24:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 2205. [2021-11-25 20:24:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 2195 states have (on average 2.293849658314351) internal successors, (5035), 2204 states have internal predecessors, (5035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 5035 transitions. [2021-11-25 20:24:04,522 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 5035 transitions. Word has length 17 [2021-11-25 20:24:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:04,522 INFO L470 AbstractCegarLoop]: Abstraction has 2205 states and 5035 transitions. [2021-11-25 20:24:04,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) [2021-11-25 20:24:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 5035 transitions. [2021-11-25 20:24:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:04,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:04,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:04,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-25 20:24:04,524 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1918027967, now seen corresponding path program 3 times [2021-11-25 20:24:04,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:04,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479194034] [2021-11-25 20:24:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:04,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:04,903 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:04,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479194034] [2021-11-25 20:24:04,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479194034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:04,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:04,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:24:04,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621300401] [2021-11-25 20:24:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:04,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:24:04,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:24:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:24:04,905 INFO L87 Difference]: Start difference. First operand 2205 states and 5035 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:08,155 INFO L93 Difference]: Finished difference Result 3939 states and 8995 transitions. [2021-11-25 20:24:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 20:24:08,156 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 [2021-11-25 20:24:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:08,160 INFO L225 Difference]: With dead ends: 3939 [2021-11-25 20:24:08,160 INFO L226 Difference]: Without dead ends: 3939 [2021-11-25 20:24:08,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 20:24:08,161 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 624 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:08,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 35 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 20:24:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2021-11-25 20:24:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2213. [2021-11-25 20:24:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2203 states have (on average 2.2932364956876987) internal successors, (5052), 2212 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 5052 transitions. [2021-11-25 20:24:08,211 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 5052 transitions. Word has length 17 [2021-11-25 20:24:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:08,211 INFO L470 AbstractCegarLoop]: Abstraction has 2213 states and 5052 transitions. [2021-11-25 20:24:08,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 5052 transitions. [2021-11-25 20:24:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:08,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:08,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:08,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-25 20:24:08,214 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:08,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash 317137541, now seen corresponding path program 4 times [2021-11-25 20:24:08,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:08,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115445560] [2021-11-25 20:24:08,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:08,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:09,065 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115445560] [2021-11-25 20:24:09,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115445560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:09,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:09,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:24:09,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489756995] [2021-11-25 20:24:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:09,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:24:09,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:24:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:24:09,067 INFO L87 Difference]: Start difference. First operand 2213 states and 5052 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) [2021-11-25 20:24:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:12,935 INFO L93 Difference]: Finished difference Result 3374 states and 7679 transitions. [2021-11-25 20:24:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 20:24:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 [2021-11-25 20:24:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:12,939 INFO L225 Difference]: With dead ends: 3374 [2021-11-25 20:24:12,940 INFO L226 Difference]: Without dead ends: 3374 [2021-11-25 20:24:12,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 20:24:12,941 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 529 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:12,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 35 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:24:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2021-11-25 20:24:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 2232. [2021-11-25 20:24:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2222 states have (on average 2.2956795679567956) internal successors, (5101), 2231 states have internal predecessors, (5101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 5101 transitions. [2021-11-25 20:24:12,984 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 5101 transitions. Word has length 17 [2021-11-25 20:24:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:12,985 INFO L470 AbstractCegarLoop]: Abstraction has 2232 states and 5101 transitions. [2021-11-25 20:24:12,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) [2021-11-25 20:24:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 5101 transitions. [2021-11-25 20:24:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:12,987 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:12,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:12,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-25 20:24:12,987 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:12,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 303068501, now seen corresponding path program 5 times [2021-11-25 20:24:12,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:12,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460679571] [2021-11-25 20:24:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:12,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:14,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:14,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460679571] [2021-11-25 20:24:14,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460679571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:14,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:14,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:24:14,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365013272] [2021-11-25 20:24:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:14,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:24:14,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:14,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:24:14,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:24:14,314 INFO L87 Difference]: Start difference. First operand 2232 states and 5101 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) [2021-11-25 20:24:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:19,944 INFO L93 Difference]: Finished difference Result 3730 states and 8490 transitions. [2021-11-25 20:24:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 20:24:19,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 [2021-11-25 20:24:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:19,948 INFO L225 Difference]: With dead ends: 3730 [2021-11-25 20:24:19,948 INFO L226 Difference]: Without dead ends: 3730 [2021-11-25 20:24:19,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 20:24:19,949 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 497 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 3822 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:19,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 34 Invalid, 3877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3822 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-25 20:24:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2021-11-25 20:24:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 2228. [2021-11-25 20:24:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2218 states have (on average 2.2953110910730388) internal successors, (5091), 2227 states have internal predecessors, (5091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 5091 transitions. [2021-11-25 20:24:20,002 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 5091 transitions. Word has length 17 [2021-11-25 20:24:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:20,003 INFO L470 AbstractCegarLoop]: Abstraction has 2228 states and 5091 transitions. [2021-11-25 20:24:20,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) [2021-11-25 20:24:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 5091 transitions. [2021-11-25 20:24:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:20,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:20,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:20,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-25 20:24:20,005 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:20,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash -994475021, now seen corresponding path program 6 times [2021-11-25 20:24:20,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:20,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750926976] [2021-11-25 20:24:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:20,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:20,374 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:20,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750926976] [2021-11-25 20:24:20,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750926976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:20,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:20,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:24:20,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963699351] [2021-11-25 20:24:20,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:20,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:24:20,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:24:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:24:20,376 INFO L87 Difference]: Start difference. First operand 2228 states and 5091 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:24,416 INFO L93 Difference]: Finished difference Result 3906 states and 8942 transitions. [2021-11-25 20:24:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 20:24:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 [2021-11-25 20:24:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:24,421 INFO L225 Difference]: With dead ends: 3906 [2021-11-25 20:24:24,421 INFO L226 Difference]: Without dead ends: 3906 [2021-11-25 20:24:24,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=368, Invalid=1038, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 20:24:24,422 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 610 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:24,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [610 Valid, 35 Invalid, 3897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3855 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 20:24:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2021-11-25 20:24:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 2213. [2021-11-25 20:24:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2203 states have (on average 2.2932364956876987) internal successors, (5052), 2212 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 5052 transitions. [2021-11-25 20:24:24,473 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 5052 transitions. Word has length 17 [2021-11-25 20:24:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:24,474 INFO L470 AbstractCegarLoop]: Abstraction has 2213 states and 5052 transitions. [2021-11-25 20:24:24,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 5052 transitions. [2021-11-25 20:24:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:24,476 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:24,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:24,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-25 20:24:24,476 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1015805841, now seen corresponding path program 7 times [2021-11-25 20:24:24,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:24,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279313804] [2021-11-25 20:24:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:24,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:24,851 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:24,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279313804] [2021-11-25 20:24:24,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279313804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:24,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:24,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:24:24,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063759926] [2021-11-25 20:24:24,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:24,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:24:24,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:24:24,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:24:24,852 INFO L87 Difference]: Start difference. First operand 2213 states and 5052 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:28,377 INFO L93 Difference]: Finished difference Result 3515 states and 8038 transitions. [2021-11-25 20:24:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 20:24:28,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 [2021-11-25 20:24:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:28,382 INFO L225 Difference]: With dead ends: 3515 [2021-11-25 20:24:28,382 INFO L226 Difference]: Without dead ends: 3515 [2021-11-25 20:24:28,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=361, Invalid=971, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 20:24:28,383 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 494 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:28,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 35 Invalid, 3448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 20:24:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2021-11-25 20:24:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 2213. [2021-11-25 20:24:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2203 states have (on average 2.2932364956876987) internal successors, (5052), 2212 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 5052 transitions. [2021-11-25 20:24:28,436 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 5052 transitions. Word has length 17 [2021-11-25 20:24:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:28,436 INFO L470 AbstractCegarLoop]: Abstraction has 2213 states and 5052 transitions. [2021-11-25 20:24:28,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 5052 transitions. [2021-11-25 20:24:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:28,439 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:28,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:28,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-25 20:24:28,439 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:28,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash 89765701, now seen corresponding path program 8 times [2021-11-25 20:24:28,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:28,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844232294] [2021-11-25 20:24:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:28,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:28,763 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:28,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844232294] [2021-11-25 20:24:28,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844232294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:28,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:28,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:24:28,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775133487] [2021-11-25 20:24:28,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:28,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:24:28,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:24:28,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:24:28,765 INFO L87 Difference]: Start difference. First operand 2213 states and 5052 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:32,657 INFO L93 Difference]: Finished difference Result 3567 states and 8124 transitions. [2021-11-25 20:24:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 20:24:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 [2021-11-25 20:24:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:32,661 INFO L225 Difference]: With dead ends: 3567 [2021-11-25 20:24:32,661 INFO L226 Difference]: Without dead ends: 3567 [2021-11-25 20:24:32,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=461, Invalid=1345, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 20:24:32,662 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 581 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:32,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 35 Invalid, 3688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 20:24:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2021-11-25 20:24:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 2223. [2021-11-25 20:24:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2213 states have (on average 2.2928151830094894) internal successors, (5074), 2222 states have internal predecessors, (5074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 5074 transitions. [2021-11-25 20:24:32,710 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 5074 transitions. Word has length 17 [2021-11-25 20:24:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:32,711 INFO L470 AbstractCegarLoop]: Abstraction has 2223 states and 5074 transitions. [2021-11-25 20:24:32,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 5074 transitions. [2021-11-25 20:24:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:32,713 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:32,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:32,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-25 20:24:32,713 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:32,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash -44418589, now seen corresponding path program 9 times [2021-11-25 20:24:32,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:32,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069086610] [2021-11-25 20:24:32,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:32,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:33,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:33,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069086610] [2021-11-25 20:24:33,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069086610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:33,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:33,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:24:33,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637971152] [2021-11-25 20:24:33,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:33,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:24:33,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:24:33,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:24:33,030 INFO L87 Difference]: Start difference. First operand 2223 states and 5074 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:37,309 INFO L93 Difference]: Finished difference Result 3290 states and 7474 transitions. [2021-11-25 20:24:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:24:37,310 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 [2021-11-25 20:24:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:37,314 INFO L225 Difference]: With dead ends: 3290 [2021-11-25 20:24:37,314 INFO L226 Difference]: Without dead ends: 3290 [2021-11-25 20:24:37,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=503, Invalid=1303, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 20:24:37,315 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 513 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 3774 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:37,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 35 Invalid, 3813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3774 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:24:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2021-11-25 20:24:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2223. [2021-11-25 20:24:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2213 states have (on average 2.2928151830094894) internal successors, (5074), 2222 states have internal predecessors, (5074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 5074 transitions. [2021-11-25 20:24:37,365 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 5074 transitions. Word has length 17 [2021-11-25 20:24:37,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:37,365 INFO L470 AbstractCegarLoop]: Abstraction has 2223 states and 5074 transitions. [2021-11-25 20:24:37,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 5074 transitions. [2021-11-25 20:24:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:37,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:37,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:37,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-25 20:24:37,367 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -15267123, now seen corresponding path program 10 times [2021-11-25 20:24:37,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:37,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792700149] [2021-11-25 20:24:37,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:37,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:37,759 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:37,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792700149] [2021-11-25 20:24:37,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792700149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:37,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:37,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:24:37,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421970681] [2021-11-25 20:24:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:37,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:24:37,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:24:37,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:24:37,761 INFO L87 Difference]: Start difference. First operand 2223 states and 5074 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:41,705 INFO L93 Difference]: Finished difference Result 4048 states and 9245 transitions. [2021-11-25 20:24:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 20:24:41,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 [2021-11-25 20:24:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:41,710 INFO L225 Difference]: With dead ends: 4048 [2021-11-25 20:24:41,710 INFO L226 Difference]: Without dead ends: 4048 [2021-11-25 20:24:41,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:24:41,711 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 629 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:41,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 35 Invalid, 3651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 20:24:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2021-11-25 20:24:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 2223. [2021-11-25 20:24:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2213 states have (on average 2.2928151830094894) internal successors, (5074), 2222 states have internal predecessors, (5074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 5074 transitions. [2021-11-25 20:24:41,744 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 5074 transitions. Word has length 17 [2021-11-25 20:24:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:41,744 INFO L470 AbstractCegarLoop]: Abstraction has 2223 states and 5074 transitions. [2021-11-25 20:24:41,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 5074 transitions. [2021-11-25 20:24:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:41,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:41,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:41,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-25 20:24:41,747 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:41,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash -527833911, now seen corresponding path program 11 times [2021-11-25 20:24:41,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:41,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684593273] [2021-11-25 20:24:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:41,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:42,379 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:42,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684593273] [2021-11-25 20:24:42,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684593273] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:42,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:42,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:24:42,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119292758] [2021-11-25 20:24:42,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:42,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:24:42,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:24:42,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:24:42,381 INFO L87 Difference]: Start difference. First operand 2223 states and 5074 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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) [2021-11-25 20:24:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:45,985 INFO L93 Difference]: Finished difference Result 3950 states and 8984 transitions. [2021-11-25 20:24:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 20:24:45,986 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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 [2021-11-25 20:24:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:45,990 INFO L225 Difference]: With dead ends: 3950 [2021-11-25 20:24:45,991 INFO L226 Difference]: Without dead ends: 3950 [2021-11-25 20:24:45,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 20:24:45,991 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 527 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 3217 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:45,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 35 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3217 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:24:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2021-11-25 20:24:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 2230. [2021-11-25 20:24:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2220 states have (on average 2.2932432432432432) internal successors, (5091), 2229 states have internal predecessors, (5091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 5091 transitions. [2021-11-25 20:24:46,026 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 5091 transitions. Word has length 17 [2021-11-25 20:24:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:46,026 INFO L470 AbstractCegarLoop]: Abstraction has 2230 states and 5091 transitions. [2021-11-25 20:24:46,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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) [2021-11-25 20:24:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 5091 transitions. [2021-11-25 20:24:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:46,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:46,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:46,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-25 20:24:46,029 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -541902951, now seen corresponding path program 12 times [2021-11-25 20:24:46,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:46,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071374340] [2021-11-25 20:24:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:46,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:46,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071374340] [2021-11-25 20:24:46,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071374340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:46,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:46,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:24:46,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944364890] [2021-11-25 20:24:46,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:46,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:24:46,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:46,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:24:46,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:24:46,543 INFO L87 Difference]: Start difference. First operand 2230 states and 5091 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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) [2021-11-25 20:24:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:49,899 INFO L93 Difference]: Finished difference Result 3931 states and 8964 transitions. [2021-11-25 20:24:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 20:24:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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 [2021-11-25 20:24:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:49,904 INFO L225 Difference]: With dead ends: 3931 [2021-11-25 20:24:49,904 INFO L226 Difference]: Without dead ends: 3931 [2021-11-25 20:24:49,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 20:24:49,906 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 472 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 3241 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:49,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 35 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3241 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 20:24:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2021-11-25 20:24:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 2205. [2021-11-25 20:24:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 2195 states have (on average 2.288382687927107) internal successors, (5023), 2204 states have internal predecessors, (5023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 5023 transitions. [2021-11-25 20:24:49,942 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 5023 transitions. Word has length 17 [2021-11-25 20:24:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:49,942 INFO L470 AbstractCegarLoop]: Abstraction has 2205 states and 5023 transitions. [2021-11-25 20:24:49,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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) [2021-11-25 20:24:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 5023 transitions. [2021-11-25 20:24:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 20:24:49,943 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:49,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:49,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-25 20:24:49,944 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1839446473, now seen corresponding path program 13 times [2021-11-25 20:24:49,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:49,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836725069] [2021-11-25 20:24:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:49,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:50,304 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:50,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836725069] [2021-11-25 20:24:50,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836725069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:50,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:50,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:24:50,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427370882] [2021-11-25 20:24:50,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:50,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:24:50,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:50,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:24:50,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:24:50,306 INFO L87 Difference]: Start difference. First operand 2205 states and 5023 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:54,166 INFO L93 Difference]: Finished difference Result 4208 states and 9577 transitions. [2021-11-25 20:24:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 20:24:54,167 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 [2021-11-25 20:24:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:54,171 INFO L225 Difference]: With dead ends: 4208 [2021-11-25 20:24:54,171 INFO L226 Difference]: Without dead ends: 4208 [2021-11-25 20:24:54,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=382, Invalid=950, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 20:24:54,172 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 581 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3807 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:54,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 35 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3807 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:24:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2021-11-25 20:24:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 2135. [2021-11-25 20:24:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2135 states, 2125 states have (on average 2.283294117647059) internal successors, (4852), 2134 states have internal predecessors, (4852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 4852 transitions. [2021-11-25 20:24:54,204 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 4852 transitions. Word has length 17 [2021-11-25 20:24:54,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:54,204 INFO L470 AbstractCegarLoop]: Abstraction has 2135 states and 4852 transitions. [2021-11-25 20:24:54,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) [2021-11-25 20:24:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 4852 transitions. [2021-11-25 20:24:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:24:54,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:54,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:54,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-25 20:24:54,207 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:54,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash -306874337, now seen corresponding path program 1 times [2021-11-25 20:24:54,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514410306] [2021-11-25 20:24:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:54,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:54,519 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:54,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514410306] [2021-11-25 20:24:54,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514410306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:54,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:54,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:24:54,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318625107] [2021-11-25 20:24:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:54,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:24:54,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:24:54,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:24:54,521 INFO L87 Difference]: Start difference. First operand 2135 states and 4852 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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) [2021-11-25 20:24:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:24:57,348 INFO L93 Difference]: Finished difference Result 3371 states and 7538 transitions. [2021-11-25 20:24:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 20:24:57,348 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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 [2021-11-25 20:24:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:24:57,352 INFO L225 Difference]: With dead ends: 3371 [2021-11-25 20:24:57,352 INFO L226 Difference]: Without dead ends: 3371 [2021-11-25 20:24:57,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=555, Invalid=1425, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 20:24:57,354 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 742 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:24:57,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 24 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 20:24:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2021-11-25 20:24:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2237. [2021-11-25 20:24:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2227 states have (on average 2.285136955545577) internal successors, (5089), 2236 states have internal predecessors, (5089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:24:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 5089 transitions. [2021-11-25 20:24:57,383 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 5089 transitions. Word has length 18 [2021-11-25 20:24:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:24:57,383 INFO L470 AbstractCegarLoop]: Abstraction has 2237 states and 5089 transitions. [2021-11-25 20:24:57,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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) [2021-11-25 20:24:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 5089 transitions. [2021-11-25 20:24:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:24:57,385 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:24:57,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:24:57,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-25 20:24:57,385 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:24:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:24:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash -256155843, now seen corresponding path program 2 times [2021-11-25 20:24:57,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:24:57,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298280851] [2021-11-25 20:24:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:24:57,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:24:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:24:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:24:57,687 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:24:57,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298280851] [2021-11-25 20:24:57,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298280851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:24:57,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:24:57,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:24:57,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293349626] [2021-11-25 20:24:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:24:57,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:24:57,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:24:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:24:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:24:57,689 INFO L87 Difference]: Start difference. First operand 2237 states and 5089 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 20:25:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:00,571 INFO L93 Difference]: Finished difference Result 3668 states and 8211 transitions. [2021-11-25 20:25:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 20:25:00,572 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 20:25:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:00,576 INFO L225 Difference]: With dead ends: 3668 [2021-11-25 20:25:00,576 INFO L226 Difference]: Without dead ends: 3668 [2021-11-25 20:25:00,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=612, Invalid=1368, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 20:25:00,577 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 1016 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:00,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1016 Valid, 24 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 20:25:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2021-11-25 20:25:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 2232. [2021-11-25 20:25:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2222 states have (on average 2.284878487848785) internal successors, (5077), 2231 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 5077 transitions. [2021-11-25 20:25:00,607 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 5077 transitions. Word has length 18 [2021-11-25 20:25:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:00,607 INFO L470 AbstractCegarLoop]: Abstraction has 2232 states and 5077 transitions. [2021-11-25 20:25:00,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 20:25:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 5077 transitions. [2021-11-25 20:25:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:00,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:00,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:00,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-25 20:25:00,609 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1322906576, now seen corresponding path program 1 times [2021-11-25 20:25:00,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:00,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143322487] [2021-11-25 20:25:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:00,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:00,955 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:00,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143322487] [2021-11-25 20:25:00,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143322487] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:00,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:00,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:25:00,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358112971] [2021-11-25 20:25:00,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:00,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:25:00,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:00,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:25:00,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:25:00,957 INFO L87 Difference]: Start difference. First operand 2232 states and 5077 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 20:25:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:03,054 INFO L93 Difference]: Finished difference Result 3625 states and 8223 transitions. [2021-11-25 20:25:03,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 20:25:03,055 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 20:25:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:03,059 INFO L225 Difference]: With dead ends: 3625 [2021-11-25 20:25:03,059 INFO L226 Difference]: Without dead ends: 3625 [2021-11-25 20:25:03,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2021-11-25 20:25:03,060 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 355 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:03,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 36 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 20:25:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2021-11-25 20:25:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 2272. [2021-11-25 20:25:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2262 states have (on average 2.281609195402299) internal successors, (5161), 2271 states have internal predecessors, (5161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 5161 transitions. [2021-11-25 20:25:03,092 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 5161 transitions. Word has length 18 [2021-11-25 20:25:03,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:03,092 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 5161 transitions. [2021-11-25 20:25:03,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 20:25:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 5161 transitions. [2021-11-25 20:25:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:03,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:03,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:03,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-25 20:25:03,094 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:03,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1295237775, now seen corresponding path program 3 times [2021-11-25 20:25:03,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:03,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988048901] [2021-11-25 20:25:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:03,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:03,331 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:03,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988048901] [2021-11-25 20:25:03,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988048901] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:03,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:03,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:25:03,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147190328] [2021-11-25 20:25:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:03,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:25:03,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:25:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:25:03,332 INFO L87 Difference]: Start difference. First operand 2272 states and 5161 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:05,421 INFO L93 Difference]: Finished difference Result 2934 states and 6591 transitions. [2021-11-25 20:25:05,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:25:05,422 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 [2021-11-25 20:25:05,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:05,425 INFO L225 Difference]: With dead ends: 2934 [2021-11-25 20:25:05,425 INFO L226 Difference]: Without dead ends: 2934 [2021-11-25 20:25:05,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:25:05,426 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 892 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:05,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [892 Valid, 22 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 20:25:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2021-11-25 20:25:05,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2264. [2021-11-25 20:25:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2254 states have (on average 2.281721384205856) internal successors, (5143), 2263 states have internal predecessors, (5143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 5143 transitions. [2021-11-25 20:25:05,453 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 5143 transitions. Word has length 18 [2021-11-25 20:25:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:05,453 INFO L470 AbstractCegarLoop]: Abstraction has 2264 states and 5143 transitions. [2021-11-25 20:25:05,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 5143 transitions. [2021-11-25 20:25:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:05,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:05,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:05,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-25 20:25:05,455 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1786150869, now seen corresponding path program 4 times [2021-11-25 20:25:05,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:05,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279514722] [2021-11-25 20:25:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:05,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:05,682 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:05,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279514722] [2021-11-25 20:25:05,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279514722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:05,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:05,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:25:05,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598490692] [2021-11-25 20:25:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:05,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:25:05,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:25:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:25:05,684 INFO L87 Difference]: Start difference. First operand 2264 states and 5143 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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) [2021-11-25 20:25:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:07,270 INFO L93 Difference]: Finished difference Result 2738 states and 6155 transitions. [2021-11-25 20:25:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 20:25:07,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 [2021-11-25 20:25:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:07,273 INFO L225 Difference]: With dead ends: 2738 [2021-11-25 20:25:07,273 INFO L226 Difference]: Without dead ends: 2738 [2021-11-25 20:25:07,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=396, Unknown=0, NotChecked=0, Total=600 [2021-11-25 20:25:07,274 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 493 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:07,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 11 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 20:25:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2021-11-25 20:25:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2286. [2021-11-25 20:25:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 2276 states have (on average 2.2789982425307556) internal successors, (5187), 2285 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 5187 transitions. [2021-11-25 20:25:07,300 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 5187 transitions. Word has length 18 [2021-11-25 20:25:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:07,300 INFO L470 AbstractCegarLoop]: Abstraction has 2286 states and 5187 transitions. [2021-11-25 20:25:07,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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) [2021-11-25 20:25:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 5187 transitions. [2021-11-25 20:25:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:07,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:07,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:07,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-25 20:25:07,302 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1988566299, now seen corresponding path program 5 times [2021-11-25 20:25:07,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:07,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980649500] [2021-11-25 20:25:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:07,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:07,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:07,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980649500] [2021-11-25 20:25:07,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980649500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:07,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:07,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:25:07,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480203168] [2021-11-25 20:25:07,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:07,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:25:07,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:07,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:25:07,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:25:07,566 INFO L87 Difference]: Start difference. First operand 2286 states and 5187 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 20:25:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:10,401 INFO L93 Difference]: Finished difference Result 2909 states and 6522 transitions. [2021-11-25 20:25:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 20:25:10,402 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 20:25:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:10,405 INFO L225 Difference]: With dead ends: 2909 [2021-11-25 20:25:10,405 INFO L226 Difference]: Without dead ends: 2909 [2021-11-25 20:25:10,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=509, Invalid=1297, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 20:25:10,406 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 671 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:10,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 22 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:25:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2021-11-25 20:25:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2294. [2021-11-25 20:25:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2284 states have (on average 2.2784588441331) internal successors, (5204), 2293 states have internal predecessors, (5204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 5204 transitions. [2021-11-25 20:25:10,440 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 5204 transitions. Word has length 18 [2021-11-25 20:25:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:10,440 INFO L470 AbstractCegarLoop]: Abstraction has 2294 states and 5204 transitions. [2021-11-25 20:25:10,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 20:25:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 5204 transitions. [2021-11-25 20:25:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:10,441 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:10,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:10,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-25 20:25:10,442 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:10,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1613461163, now seen corresponding path program 6 times [2021-11-25 20:25:10,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:10,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137629733] [2021-11-25 20:25:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:10,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:10,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:10,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137629733] [2021-11-25 20:25:10,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137629733] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:10,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:10,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:25:10,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655345988] [2021-11-25 20:25:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:10,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:25:10,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:10,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:25:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:25:10,670 INFO L87 Difference]: Start difference. First operand 2294 states and 5204 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:13,937 INFO L93 Difference]: Finished difference Result 2961 states and 6638 transitions. [2021-11-25 20:25:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:25:13,938 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 [2021-11-25 20:25:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:13,941 INFO L225 Difference]: With dead ends: 2961 [2021-11-25 20:25:13,941 INFO L226 Difference]: Without dead ends: 2961 [2021-11-25 20:25:13,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=524, Invalid=1282, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 20:25:13,942 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 577 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:13,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 22 Invalid, 3964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 20:25:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2021-11-25 20:25:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2293. [2021-11-25 20:25:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 2283 states have (on average 2.278580814717477) internal successors, (5202), 2292 states have internal predecessors, (5202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5202 transitions. [2021-11-25 20:25:13,971 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5202 transitions. Word has length 18 [2021-11-25 20:25:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:13,971 INFO L470 AbstractCegarLoop]: Abstraction has 2293 states and 5202 transitions. [2021-11-25 20:25:13,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5202 transitions. [2021-11-25 20:25:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:13,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:13,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:13,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-25 20:25:13,973 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash -441864539, now seen corresponding path program 7 times [2021-11-25 20:25:13,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:13,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201031035] [2021-11-25 20:25:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:13,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:14,194 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:14,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201031035] [2021-11-25 20:25:14,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201031035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:14,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:14,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:25:14,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614534190] [2021-11-25 20:25:14,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:14,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:25:14,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:14,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:25:14,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:25:14,196 INFO L87 Difference]: Start difference. First operand 2293 states and 5202 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:17,203 INFO L93 Difference]: Finished difference Result 2994 states and 6707 transitions. [2021-11-25 20:25:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:25:17,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 [2021-11-25 20:25:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:17,207 INFO L225 Difference]: With dead ends: 2994 [2021-11-25 20:25:17,207 INFO L226 Difference]: Without dead ends: 2994 [2021-11-25 20:25:17,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=599, Invalid=1381, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 20:25:17,208 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 658 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 3271 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:17,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [658 Valid, 22 Invalid, 3304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3271 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:25:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2021-11-25 20:25:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2297. [2021-11-25 20:25:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 2287 states have (on average 2.2780935723655444) internal successors, (5210), 2296 states have internal predecessors, (5210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 5210 transitions. [2021-11-25 20:25:17,240 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 5210 transitions. Word has length 18 [2021-11-25 20:25:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:17,240 INFO L470 AbstractCegarLoop]: Abstraction has 2297 states and 5210 transitions. [2021-11-25 20:25:17,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 5210 transitions. [2021-11-25 20:25:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:17,242 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:17,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:17,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-25 20:25:17,242 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1800629701, now seen corresponding path program 8 times [2021-11-25 20:25:17,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:17,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628849380] [2021-11-25 20:25:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:17,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:17,492 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:17,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628849380] [2021-11-25 20:25:17,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628849380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:17,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:17,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:25:17,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883960938] [2021-11-25 20:25:17,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:17,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:25:17,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:25:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:25:17,494 INFO L87 Difference]: Start difference. First operand 2297 states and 5210 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:21,157 INFO L93 Difference]: Finished difference Result 3058 states and 6847 transitions. [2021-11-25 20:25:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 20:25:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 [2021-11-25 20:25:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:21,161 INFO L225 Difference]: With dead ends: 3058 [2021-11-25 20:25:21,161 INFO L226 Difference]: Without dead ends: 3058 [2021-11-25 20:25:21,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=667, Invalid=1589, Unknown=0, NotChecked=0, Total=2256 [2021-11-25 20:25:21,163 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 688 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 3901 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:21,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 22 Invalid, 3937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3901 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 20:25:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2021-11-25 20:25:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2290. [2021-11-25 20:25:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2280 states have (on average 2.2785087719298245) internal successors, (5195), 2289 states have internal predecessors, (5195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 5195 transitions. [2021-11-25 20:25:21,193 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 5195 transitions. Word has length 18 [2021-11-25 20:25:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:21,193 INFO L470 AbstractCegarLoop]: Abstraction has 2290 states and 5195 transitions. [2021-11-25 20:25:21,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 5195 transitions. [2021-11-25 20:25:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:21,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:21,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:21,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-25 20:25:21,195 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:21,196 INFO L85 PathProgramCache]: Analyzing trace with hash -370481977, now seen corresponding path program 9 times [2021-11-25 20:25:21,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:21,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860549927] [2021-11-25 20:25:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:21,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:21,436 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:21,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860549927] [2021-11-25 20:25:21,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860549927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:21,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:21,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:25:21,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177032814] [2021-11-25 20:25:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:21,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:25:21,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:25:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:25:21,438 INFO L87 Difference]: Start difference. First operand 2290 states and 5195 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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) [2021-11-25 20:25:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:23,233 INFO L93 Difference]: Finished difference Result 2755 states and 6185 transitions. [2021-11-25 20:25:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 20:25:23,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 [2021-11-25 20:25:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:23,236 INFO L225 Difference]: With dead ends: 2755 [2021-11-25 20:25:23,236 INFO L226 Difference]: Without dead ends: 2755 [2021-11-25 20:25:23,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2021-11-25 20:25:23,237 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 535 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:23,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 11 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 20:25:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2021-11-25 20:25:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2277. [2021-11-25 20:25:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2267 states have (on average 2.2779003087781207) internal successors, (5164), 2276 states have internal predecessors, (5164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 5164 transitions. [2021-11-25 20:25:23,264 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 5164 transitions. Word has length 18 [2021-11-25 20:25:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:23,264 INFO L470 AbstractCegarLoop]: Abstraction has 2277 states and 5164 transitions. [2021-11-25 20:25:23,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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) [2021-11-25 20:25:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 5164 transitions. [2021-11-25 20:25:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:23,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:23,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:23,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-25 20:25:23,266 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:23,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash -572897407, now seen corresponding path program 10 times [2021-11-25 20:25:23,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:23,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456916213] [2021-11-25 20:25:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:23,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:23,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:23,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456916213] [2021-11-25 20:25:23,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456916213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:23,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:23,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:25:23,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807561438] [2021-11-25 20:25:23,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:23,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:25:23,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:23,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:25:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:25:23,492 INFO L87 Difference]: Start difference. First operand 2277 states and 5164 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 20:25:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:25,986 INFO L93 Difference]: Finished difference Result 2949 states and 6599 transitions. [2021-11-25 20:25:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:25:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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 [2021-11-25 20:25:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:25,990 INFO L225 Difference]: With dead ends: 2949 [2021-11-25 20:25:25,990 INFO L226 Difference]: Without dead ends: 2949 [2021-11-25 20:25:25,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=477, Invalid=1163, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:25:25,991 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 637 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:25,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 22 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 20:25:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2021-11-25 20:25:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2273. [2021-11-25 20:25:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 2263 states have (on average 2.2779496243923996) internal successors, (5155), 2272 states have internal predecessors, (5155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 5155 transitions. [2021-11-25 20:25:26,021 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 5155 transitions. Word has length 18 [2021-11-25 20:25:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:26,021 INFO L470 AbstractCegarLoop]: Abstraction has 2273 states and 5155 transitions. [2021-11-25 20:25:26,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2021-11-25 20:25:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 5155 transitions. [2021-11-25 20:25:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 20:25:26,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:26,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:26,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-25 20:25:26,023 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1265837241, now seen corresponding path program 11 times [2021-11-25 20:25:26,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:26,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972666710] [2021-11-25 20:25:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:26,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:26,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:26,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972666710] [2021-11-25 20:25:26,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972666710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:26,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:26,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:25:26,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662558712] [2021-11-25 20:25:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:26,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:25:26,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:26,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:25:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:25:26,271 INFO L87 Difference]: Start difference. First operand 2273 states and 5155 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:29,140 INFO L93 Difference]: Finished difference Result 2965 states and 6640 transitions. [2021-11-25 20:25:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 20:25:29,140 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 [2021-11-25 20:25:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:29,143 INFO L225 Difference]: With dead ends: 2965 [2021-11-25 20:25:29,143 INFO L226 Difference]: Without dead ends: 2965 [2021-11-25 20:25:29,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:25:29,144 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 601 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 3328 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:29,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 22 Invalid, 3374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3328 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:25:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2021-11-25 20:25:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2263. [2021-11-25 20:25:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 2253 states have (on average 2.278739458499778) internal successors, (5134), 2262 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 5134 transitions. [2021-11-25 20:25:29,176 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 5134 transitions. Word has length 18 [2021-11-25 20:25:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:29,176 INFO L470 AbstractCegarLoop]: Abstraction has 2263 states and 5134 transitions. [2021-11-25 20:25:29,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) [2021-11-25 20:25:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 5134 transitions. [2021-11-25 20:25:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 20:25:29,178 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:29,178 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:29,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-25 20:25:29,179 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 633380839, now seen corresponding path program 1 times [2021-11-25 20:25:29,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:29,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123631194] [2021-11-25 20:25:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:29,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:29,479 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:29,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123631194] [2021-11-25 20:25:29,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123631194] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:25:29,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185658568] [2021-11-25 20:25:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:29,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:25:29,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:25:29,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:25:29,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:25:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:29,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 154 conjunts are in the unsatisfiable core [2021-11-25 20:25:29,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:25:29,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:29,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:29,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2021-11-25 20:25:29,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:29,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:29,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:29,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2021-11-25 20:25:30,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2021-11-25 20:25:30,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2021-11-25 20:25:30,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2021-11-25 20:25:30,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2021-11-25 20:25:30,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 43 [2021-11-25 20:25:30,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 34 [2021-11-25 20:25:30,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:25:30,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:30,716 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-11-25 20:25:30,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 27 [2021-11-25 20:25:30,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:25:30,795 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-25 20:25:30,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 43 [2021-11-25 20:25:30,875 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:25:30,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-11-25 20:25:30,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2021-11-25 20:25:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:30,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:25:31,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_3882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:31,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_3881)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_3882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:31,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_3881)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_3882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:31,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_3881)) .cse0 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:31,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) 12)) v_ArrVal_3881)) .cse0 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:31,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1) 12)) v_ArrVal_3881)) .cse0 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:31,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) 12)) v_ArrVal_3881)) .cse0 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 20:25:31,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185658568] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:25:31,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1862846853] [2021-11-25 20:25:31,136 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:25:31,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:25:31,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2021-11-25 20:25:31,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669486033] [2021-11-25 20:25:31,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:25:31,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 20:25:31,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 20:25:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=469, Unknown=7, NotChecked=350, Total=930 [2021-11-25 20:25:31,142 INFO L87 Difference]: Start difference. First operand 2263 states and 5134 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:33,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse3 (select .cse7 4))) (and (= (select .cse0 0) 4) (= 0 (select .cse0 16)) (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= (select .cse1 .cse2) 0) (not (= (select (select |c_#memory_$Pointer$.base| .cse3) 12) |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse4 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse0 12) 4) (not (= .cse4 0)) (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse6 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse6) 12)) v_ArrVal_3881)) .cse5 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= (select .cse7 .cse2) .cse4) (= (select .cse1 4) 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)))))) is different from false [2021-11-25 20:25:35,423 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse6 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse4 (select .cse3 4))) (and (= (select .cse0 0) 4) (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2) 12)) v_ArrVal_3881)) .cse1 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= 0 (select .cse0 16)) (not (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_#in~q_#1.base| (select (select |c_#memory_$Pointer$.base| .cse4) 12))) (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= (select .cse5 .cse6) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (< (+ .cse7 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse0 12) 4) (not (= .cse7 0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (= (select .cse8 .cse6) .cse7) (not (= .cse4 |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0))))) is different from false [2021-11-25 20:25:37,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse0 (select .cse2 4)) (.cse4 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (and (not (= |c_pusherThread1of1ForFork0_~q~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= (select .cse1 0) 4) (not (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= 0 (select .cse1 16)) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= (select .cse3 .cse4) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse5 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse1 12) 4) (not (= .cse5 0)) (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse7 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12)) v_ArrVal_3881)) .cse6 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) 4) 0) (not (= |c_pusherThread1of1ForFork0_~q~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) 12))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select .cse8 .cse4) .cse5) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0))))) is different from false [2021-11-25 20:25:38,807 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse6 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse2 (select .cse1 .cse9))) (and (= (select .cse0 0) 4) (not (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= .cse2 |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (= 0 (select .cse0 16)) (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse3) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4))) v_ArrVal_3881)) .cse3 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= (select .cse5 .cse6) 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) 12) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse7 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse0 12) 4) (not (= .cse7 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select .cse8 .cse6) .cse7) (not (= .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9)))))) is different from false [2021-11-25 20:25:40,215 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| .cse8)) (.cse7 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse5 (select .cse1 .cse6))) (and (= (select .cse0 0) 4) (not (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= 0 (select .cse0 16)) (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse2) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) v_ArrVal_3881)) .cse2 v_ArrVal_3882))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (not (= (select (select |c_#memory_$Pointer$.base| .cse5) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= (select .cse4 .cse7) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse8 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse0 12) 4) (not (= .cse8 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select .cse9 .cse7) .cse8) (not (= .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)))))) is different from false [2021-11-25 20:25:42,249 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse2 (select .cse1 .cse6)) (.cse4 (select .cse5 .cse6))) (and (= (select .cse0 0) 4) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (= 0 (select .cse0 16)) (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= .cse2 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse3 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse0 12) 4) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (= .cse4 .cse3) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_3881)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_3882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) is different from false [2021-11-25 20:25:44,268 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (= 4 |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset|) (forall ((v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3881 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_3881)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_3882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse0 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (not (= .cse0 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= .cse1 .cse0) (= .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) is different from false [2021-11-25 20:25:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:45,197 INFO L93 Difference]: Finished difference Result 2594 states and 5940 transitions. [2021-11-25 20:25:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:25:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 20:25:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:45,203 INFO L225 Difference]: With dead ends: 2594 [2021-11-25 20:25:45,203 INFO L226 Difference]: Without dead ends: 2594 [2021-11-25 20:25:45,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=138, Invalid=606, Unknown=14, NotChecked=882, Total=1640 [2021-11-25 20:25:45,204 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 852 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:45,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1372 Invalid, 0 Unknown, 852 Unchecked, 1.1s Time] [2021-11-25 20:25:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2021-11-25 20:25:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2290. [2021-11-25 20:25:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2280 states have (on average 2.278947368421053) internal successors, (5196), 2289 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 5196 transitions. [2021-11-25 20:25:45,245 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 5196 transitions. Word has length 19 [2021-11-25 20:25:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:45,245 INFO L470 AbstractCegarLoop]: Abstraction has 2290 states and 5196 transitions. [2021-11-25 20:25:45,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 5196 transitions. [2021-11-25 20:25:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 20:25:45,247 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:45,247 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:45,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:25:45,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-11-25 20:25:45,462 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash -258431655, now seen corresponding path program 2 times [2021-11-25 20:25:45,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:45,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814647211] [2021-11-25 20:25:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:45,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:46,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:46,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814647211] [2021-11-25 20:25:46,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814647211] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:25:46,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521643804] [2021-11-25 20:25:46,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:25:46,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:25:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:25:46,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:25:46,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 20:25:46,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:25:46,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:25:46,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 125 conjunts are in the unsatisfiable core [2021-11-25 20:25:46,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:25:46,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 20:25:46,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2021-11-25 20:25:46,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2021-11-25 20:25:46,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:25:46,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:46,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2021-11-25 20:25:46,915 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 20:25:46,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 72 [2021-11-25 20:25:46,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2021-11-25 20:25:46,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2021-11-25 20:25:47,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:25:47,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 20:25:47,586 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 20:25:47,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 74 [2021-11-25 20:25:47,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-11-25 20:25:47,715 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:25:47,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2021-11-25 20:25:47,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2021-11-25 20:25:47,945 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:25:47,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 16 [2021-11-25 20:25:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:47,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:25:47,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 4 [2021-11-25 20:25:47,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:47,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_4071) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:48,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_4071) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:48,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_4071) .cse0 v_ArrVal_4072))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:48,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) 12)) v_ArrVal_4071) .cse0 v_ArrVal_4072))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:48,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1) 12)) v_ArrVal_4071) .cse0 v_ArrVal_4072))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:48,067 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (not (= 0 (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) 12)) v_ArrVal_4071) .cse0 v_ArrVal_4072))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2021-11-25 20:25:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 20:25:48,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521643804] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:25:48,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [229727172] [2021-11-25 20:25:48,070 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:25:48,071 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:25:48,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 31 [2021-11-25 20:25:48,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110126210] [2021-11-25 20:25:48,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:25:48,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 20:25:48,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 20:25:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=542, Unknown=7, NotChecked=378, Total=1056 [2021-11-25 20:25:48,073 INFO L87 Difference]: Start difference. First operand 2290 states and 5196 transitions. Second operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:55,178 INFO L93 Difference]: Finished difference Result 4075 states and 9219 transitions. [2021-11-25 20:25:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-25 20:25:55,179 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 20:25:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:55,183 INFO L225 Difference]: With dead ends: 4075 [2021-11-25 20:25:55,183 INFO L226 Difference]: Without dead ends: 4075 [2021-11-25 20:25:55,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=745, Invalid=3058, Unknown=7, NotChecked=882, Total=4692 [2021-11-25 20:25:55,184 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 1534 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 4745 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 7866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3075 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:55,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 35 Invalid, 7866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4745 Invalid, 0 Unknown, 3075 Unchecked, 3.7s Time] [2021-11-25 20:25:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2021-11-25 20:25:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2411. [2021-11-25 20:25:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2401 states have (on average 2.2940441482715537) internal successors, (5508), 2410 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 5508 transitions. [2021-11-25 20:25:55,216 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 5508 transitions. Word has length 19 [2021-11-25 20:25:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:55,216 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 5508 transitions. [2021-11-25 20:25:55,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 5508 transitions. [2021-11-25 20:25:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 20:25:55,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:55,217 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:55,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-25 20:25:55,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-11-25 20:25:55,430 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:25:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:55,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1927962521, now seen corresponding path program 3 times [2021-11-25 20:25:55,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:55,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906136191] [2021-11-25 20:25:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:55,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:55,887 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906136191] [2021-11-25 20:25:55,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906136191] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:25:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222418363] [2021-11-25 20:25:55,888 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:25:55,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:25:55,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:25:55,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:25:55,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 20:25:56,232 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:25:56,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:25:56,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-25 20:25:56,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:25:56,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:56,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:56,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:56,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:56,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 20:25:56,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:56,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:56,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2021-11-25 20:25:56,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:25:56,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:25:56,313 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 20:25:56,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 75 [2021-11-25 20:25:56,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2021-11-25 20:25:56,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-11-25 20:25:56,915 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 20:25:56,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 72 [2021-11-25 20:25:56,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-11-25 20:25:56,988 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:25:56,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2021-11-25 20:25:57,101 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:25:57,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 16 [2021-11-25 20:25:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:57,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:25:57,186 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4259 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_4259) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:57,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4259 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_4258) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_4259) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:57,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4259 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_4258) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_4259) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:57,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4259 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_4258) .cse0 v_ArrVal_4259))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:57,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4259 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) 12)) v_ArrVal_4258) .cse0 v_ArrVal_4259))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:57,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4259 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1) 12)) v_ArrVal_4258) .cse0 v_ArrVal_4259))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:57,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4259 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) 12)) v_ArrVal_4258) .cse0 v_ArrVal_4259))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:25:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 20:25:57,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222418363] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:25:57,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [793995688] [2021-11-25 20:25:57,283 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:25:57,285 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:25:57,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 34 [2021-11-25 20:25:57,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699702487] [2021-11-25 20:25:57,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:25:57,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 20:25:57,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:57,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 20:25:57,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=711, Unknown=7, NotChecked=420, Total=1260 [2021-11-25 20:25:57,287 INFO L87 Difference]: Start difference. First operand 2411 states and 5508 transitions. Second operand has 36 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:05,705 INFO L93 Difference]: Finished difference Result 5143 states and 11633 transitions. [2021-11-25 20:26:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-25 20:26:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 20:26:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:05,711 INFO L225 Difference]: With dead ends: 5143 [2021-11-25 20:26:05,712 INFO L226 Difference]: Without dead ends: 5143 [2021-11-25 20:26:05,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1125, Invalid=6036, Unknown=7, NotChecked=1204, Total=8372 [2021-11-25 20:26:05,712 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 1603 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 7591 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 11674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 7591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3971 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:05,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1603 Valid, 53 Invalid, 11674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 7591 Invalid, 0 Unknown, 3971 Unchecked, 4.7s Time] [2021-11-25 20:26:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5143 states. [2021-11-25 20:26:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5143 to 2402. [2021-11-25 20:26:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 2392 states have (on average 2.293896321070234) internal successors, (5487), 2401 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 5487 transitions. [2021-11-25 20:26:05,752 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 5487 transitions. Word has length 19 [2021-11-25 20:26:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:05,753 INFO L470 AbstractCegarLoop]: Abstraction has 2402 states and 5487 transitions. [2021-11-25 20:26:05,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 5487 transitions. [2021-11-25 20:26:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:05,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:05,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:05,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 20:26:05,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-25 20:26:05,960 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1443059996, now seen corresponding path program 1 times [2021-11-25 20:26:05,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:05,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982551229] [2021-11-25 20:26:05,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:05,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:06,326 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:06,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982551229] [2021-11-25 20:26:06,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982551229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:06,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:06,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 20:26:06,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119219316] [2021-11-25 20:26:06,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:06,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:26:06,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:26:06,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:26:06,328 INFO L87 Difference]: Start difference. First operand 2402 states and 5487 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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) [2021-11-25 20:26:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:10,175 INFO L93 Difference]: Finished difference Result 4744 states and 10783 transitions. [2021-11-25 20:26:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 20:26:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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 [2021-11-25 20:26:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:10,181 INFO L225 Difference]: With dead ends: 4744 [2021-11-25 20:26:10,181 INFO L226 Difference]: Without dead ends: 4744 [2021-11-25 20:26:10,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=714, Invalid=1938, Unknown=0, NotChecked=0, Total=2652 [2021-11-25 20:26:10,181 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 897 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 3373 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 3373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:10,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [897 Valid, 24 Invalid, 3504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 3373 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 20:26:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2021-11-25 20:26:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 2594. [2021-11-25 20:26:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2584 states have (on average 2.3138544891640866) internal successors, (5979), 2593 states have internal predecessors, (5979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 5979 transitions. [2021-11-25 20:26:10,222 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 5979 transitions. Word has length 20 [2021-11-25 20:26:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:10,222 INFO L470 AbstractCegarLoop]: Abstraction has 2594 states and 5979 transitions. [2021-11-25 20:26:10,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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) [2021-11-25 20:26:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 5979 transitions. [2021-11-25 20:26:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:10,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:10,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:10,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-25 20:26:10,224 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash -576967547, now seen corresponding path program 1 times [2021-11-25 20:26:10,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:10,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623703465] [2021-11-25 20:26:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:10,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:10,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:10,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623703465] [2021-11-25 20:26:10,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623703465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:10,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:10,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:26:10,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630839220] [2021-11-25 20:26:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:10,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:26:10,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:26:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:26:10,565 INFO L87 Difference]: Start difference. First operand 2594 states and 5979 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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) [2021-11-25 20:26:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:13,280 INFO L93 Difference]: Finished difference Result 7378 states and 16601 transitions. [2021-11-25 20:26:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 20:26:13,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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 [2021-11-25 20:26:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:13,297 INFO L225 Difference]: With dead ends: 7378 [2021-11-25 20:26:13,297 INFO L226 Difference]: Without dead ends: 7338 [2021-11-25 20:26:13,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=378, Invalid=954, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 20:26:13,298 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 1188 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:13,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 71 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 20:26:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2021-11-25 20:26:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 2614. [2021-11-25 20:26:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2604 states have (on average 2.313748079877112) internal successors, (6025), 2613 states have internal predecessors, (6025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 6025 transitions. [2021-11-25 20:26:13,375 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 6025 transitions. Word has length 20 [2021-11-25 20:26:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:13,376 INFO L470 AbstractCegarLoop]: Abstraction has 2614 states and 6025 transitions. [2021-11-25 20:26:13,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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) [2021-11-25 20:26:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 6025 transitions. [2021-11-25 20:26:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:13,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:13,378 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:13,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-25 20:26:13,378 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:13,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1810355950, now seen corresponding path program 1 times [2021-11-25 20:26:13,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:13,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921234705] [2021-11-25 20:26:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:13,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:15,803 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:15,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921234705] [2021-11-25 20:26:15,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921234705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:15,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:15,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:26:15,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992980224] [2021-11-25 20:26:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:15,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:26:15,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:15,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:26:15,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:26:15,805 INFO L87 Difference]: Start difference. First operand 2614 states and 6025 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:26:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:26,641 INFO L93 Difference]: Finished difference Result 4267 states and 9680 transitions. [2021-11-25 20:26:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 20:26:26,642 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:26:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:26,653 INFO L225 Difference]: With dead ends: 4267 [2021-11-25 20:26:26,653 INFO L226 Difference]: Without dead ends: 4267 [2021-11-25 20:26:26,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=453, Invalid=2097, Unknown=0, NotChecked=0, Total=2550 [2021-11-25 20:26:26,653 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 686 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 7276 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 7276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:26,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [686 Valid, 24 Invalid, 7332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 7276 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2021-11-25 20:26:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2021-11-25 20:26:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 2756. [2021-11-25 20:26:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2746 states have (on average 2.324107793153678) internal successors, (6382), 2755 states have internal predecessors, (6382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 6382 transitions. [2021-11-25 20:26:26,710 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 6382 transitions. Word has length 20 [2021-11-25 20:26:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:26,710 INFO L470 AbstractCegarLoop]: Abstraction has 2756 states and 6382 transitions. [2021-11-25 20:26:26,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:26:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 6382 transitions. [2021-11-25 20:26:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:26,713 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:26,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:26,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-25 20:26:26,713 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:26,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:26,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1356074822, now seen corresponding path program 2 times [2021-11-25 20:26:26,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:26,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548090112] [2021-11-25 20:26:26,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:26,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:27,012 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:27,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548090112] [2021-11-25 20:26:27,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548090112] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:27,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:27,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 20:26:27,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562232455] [2021-11-25 20:26:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:27,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:26:27,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:26:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:26:27,013 INFO L87 Difference]: Start difference. First operand 2756 states and 6382 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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) [2021-11-25 20:26:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:28,626 INFO L93 Difference]: Finished difference Result 3778 states and 8573 transitions. [2021-11-25 20:26:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 20:26:28,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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 [2021-11-25 20:26:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:28,633 INFO L225 Difference]: With dead ends: 3778 [2021-11-25 20:26:28,633 INFO L226 Difference]: Without dead ends: 3778 [2021-11-25 20:26:28,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2021-11-25 20:26:28,634 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 865 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:28,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 17 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 20:26:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2021-11-25 20:26:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 2807. [2021-11-25 20:26:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2797 states have (on average 2.32213085448695) internal successors, (6495), 2806 states have internal predecessors, (6495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 6495 transitions. [2021-11-25 20:26:28,677 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 6495 transitions. Word has length 20 [2021-11-25 20:26:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:28,677 INFO L470 AbstractCegarLoop]: Abstraction has 2807 states and 6495 transitions. [2021-11-25 20:26:28,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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) [2021-11-25 20:26:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 6495 transitions. [2021-11-25 20:26:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:28,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:28,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:28,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-25 20:26:28,679 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1429329674, now seen corresponding path program 3 times [2021-11-25 20:26:28,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:28,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63980035] [2021-11-25 20:26:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:28,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:29,039 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:29,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63980035] [2021-11-25 20:26:29,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63980035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:29,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:29,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 20:26:29,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219447542] [2021-11-25 20:26:29,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:29,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:26:29,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:29,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:26:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:26:29,041 INFO L87 Difference]: Start difference. First operand 2807 states and 6495 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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) [2021-11-25 20:26:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:32,532 INFO L93 Difference]: Finished difference Result 6120 states and 14029 transitions. [2021-11-25 20:26:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 20:26:32,533 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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 [2021-11-25 20:26:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:32,546 INFO L225 Difference]: With dead ends: 6120 [2021-11-25 20:26:32,546 INFO L226 Difference]: Without dead ends: 6120 [2021-11-25 20:26:32,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=683, Invalid=1669, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 20:26:32,547 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1094 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:32,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 34 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 20:26:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2021-11-25 20:26:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 3034. [2021-11-25 20:26:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3024 states have (on average 2.3356481481481484) internal successors, (7063), 3033 states have internal predecessors, (7063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 7063 transitions. [2021-11-25 20:26:32,624 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 7063 transitions. Word has length 20 [2021-11-25 20:26:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:32,625 INFO L470 AbstractCegarLoop]: Abstraction has 3034 states and 7063 transitions. [2021-11-25 20:26:32,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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) [2021-11-25 20:26:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 7063 transitions. [2021-11-25 20:26:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:32,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:32,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:32,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-25 20:26:32,628 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1341948864, now seen corresponding path program 4 times [2021-11-25 20:26:32,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:32,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396709335] [2021-11-25 20:26:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:32,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:32,919 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396709335] [2021-11-25 20:26:32,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396709335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:32,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:32,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:26:32,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722923130] [2021-11-25 20:26:32,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:32,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:26:32,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:26:32,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:26:32,921 INFO L87 Difference]: Start difference. First operand 3034 states and 7063 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2021-11-25 20:26:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:36,396 INFO L93 Difference]: Finished difference Result 6742 states and 15530 transitions. [2021-11-25 20:26:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-25 20:26:36,397 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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 [2021-11-25 20:26:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:36,407 INFO L225 Difference]: With dead ends: 6742 [2021-11-25 20:26:36,407 INFO L226 Difference]: Without dead ends: 6742 [2021-11-25 20:26:36,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=836, Invalid=2026, Unknown=0, NotChecked=0, Total=2862 [2021-11-25 20:26:36,408 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1313 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 2854 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:36,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1313 Valid, 34 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2854 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:26:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2021-11-25 20:26:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 2791. [2021-11-25 20:26:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2781 states have (on average 2.321826681049982) internal successors, (6457), 2790 states have internal predecessors, (6457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 6457 transitions. [2021-11-25 20:26:36,481 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 6457 transitions. Word has length 20 [2021-11-25 20:26:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:36,482 INFO L470 AbstractCegarLoop]: Abstraction has 2791 states and 6457 transitions. [2021-11-25 20:26:36,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2021-11-25 20:26:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 6457 transitions. [2021-11-25 20:26:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:36,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:36,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:36,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-25 20:26:36,485 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1515230971, now seen corresponding path program 2 times [2021-11-25 20:26:36,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:36,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489753547] [2021-11-25 20:26:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:36,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:36,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:36,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489753547] [2021-11-25 20:26:36,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489753547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:36,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:36,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:26:36,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736413263] [2021-11-25 20:26:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:36,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:26:36,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:36,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:26:36,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:26:36,800 INFO L87 Difference]: Start difference. First operand 2791 states and 6457 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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) [2021-11-25 20:26:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:39,362 INFO L93 Difference]: Finished difference Result 3627 states and 8229 transitions. [2021-11-25 20:26:39,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 20:26:39,362 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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 [2021-11-25 20:26:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:39,367 INFO L225 Difference]: With dead ends: 3627 [2021-11-25 20:26:39,367 INFO L226 Difference]: Without dead ends: 3607 [2021-11-25 20:26:39,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2021-11-25 20:26:39,367 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 446 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:39,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 33 Invalid, 2706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 20:26:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2021-11-25 20:26:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 2789. [2021-11-25 20:26:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2779 states have (on average 2.3216984526808204) internal successors, (6452), 2788 states have internal predecessors, (6452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 6452 transitions. [2021-11-25 20:26:39,403 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 6452 transitions. Word has length 20 [2021-11-25 20:26:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:39,403 INFO L470 AbstractCegarLoop]: Abstraction has 2789 states and 6452 transitions. [2021-11-25 20:26:39,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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) [2021-11-25 20:26:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 6452 transitions. [2021-11-25 20:26:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:39,405 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:39,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:39,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-25 20:26:39,405 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash -53919848, now seen corresponding path program 2 times [2021-11-25 20:26:39,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:39,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926882991] [2021-11-25 20:26:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:39,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:40,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926882991] [2021-11-25 20:26:40,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926882991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:40,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:40,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 20:26:40,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139003298] [2021-11-25 20:26:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:40,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:26:40,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:40,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:26:40,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:26:40,214 INFO L87 Difference]: Start difference. First operand 2789 states and 6452 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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) [2021-11-25 20:26:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:44,459 INFO L93 Difference]: Finished difference Result 4187 states and 9562 transitions. [2021-11-25 20:26:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 20:26:44,459 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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 [2021-11-25 20:26:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:44,464 INFO L225 Difference]: With dead ends: 4187 [2021-11-25 20:26:44,464 INFO L226 Difference]: Without dead ends: 4187 [2021-11-25 20:26:44,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:26:44,465 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 753 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 4112 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 4164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:44,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [753 Valid, 35 Invalid, 4164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4112 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-25 20:26:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4187 states. [2021-11-25 20:26:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4187 to 2783. [2021-11-25 20:26:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2773 states have (on average 2.32023079697079) internal successors, (6434), 2782 states have internal predecessors, (6434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 6434 transitions. [2021-11-25 20:26:44,500 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 6434 transitions. Word has length 20 [2021-11-25 20:26:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:44,500 INFO L470 AbstractCegarLoop]: Abstraction has 2783 states and 6434 transitions. [2021-11-25 20:26:44,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 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) [2021-11-25 20:26:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 6434 transitions. [2021-11-25 20:26:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:44,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:44,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:44,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-25 20:26:44,502 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1257557666, now seen corresponding path program 3 times [2021-11-25 20:26:44,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:44,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482081382] [2021-11-25 20:26:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:44,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:46,070 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:46,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482081382] [2021-11-25 20:26:46,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482081382] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:46,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:46,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:26:46,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146659191] [2021-11-25 20:26:46,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:46,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:26:46,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:46,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:26:46,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:26:46,072 INFO L87 Difference]: Start difference. First operand 2783 states and 6434 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:26:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:26:56,549 INFO L93 Difference]: Finished difference Result 4325 states and 9867 transitions. [2021-11-25 20:26:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 20:26:56,550 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:26:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:26:56,555 INFO L225 Difference]: With dead ends: 4325 [2021-11-25 20:26:56,555 INFO L226 Difference]: Without dead ends: 4325 [2021-11-25 20:26:56,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=512, Invalid=2568, Unknown=0, NotChecked=0, Total=3080 [2021-11-25 20:26:56,556 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 652 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 8378 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 8442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 8378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:26:56,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [652 Valid, 34 Invalid, 8442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 8378 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2021-11-25 20:26:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4325 states. [2021-11-25 20:26:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4325 to 2827. [2021-11-25 20:26:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2817 states have (on average 2.3205537806176784) internal successors, (6537), 2826 states have internal predecessors, (6537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:26:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 6537 transitions. [2021-11-25 20:26:56,591 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 6537 transitions. Word has length 20 [2021-11-25 20:26:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:26:56,591 INFO L470 AbstractCegarLoop]: Abstraction has 2827 states and 6537 transitions. [2021-11-25 20:26:56,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:26:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 6537 transitions. [2021-11-25 20:26:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:26:56,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:26:56,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:26:56,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-25 20:26:56,593 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:26:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:26:56,594 INFO L85 PathProgramCache]: Analyzing trace with hash 498878436, now seen corresponding path program 4 times [2021-11-25 20:26:56,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:26:56,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304826374] [2021-11-25 20:26:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:26:56,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:26:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:26:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:26:59,750 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:26:59,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304826374] [2021-11-25 20:26:59,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304826374] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:26:59,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:26:59,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:26:59,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670702544] [2021-11-25 20:26:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:26:59,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:26:59,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:26:59,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:26:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:26:59,752 INFO L87 Difference]: Start difference. First operand 2827 states and 6537 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:27:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:11,009 INFO L93 Difference]: Finished difference Result 4095 states and 9363 transitions. [2021-11-25 20:27:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:27:11,009 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:27:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:11,013 INFO L225 Difference]: With dead ends: 4095 [2021-11-25 20:27:11,013 INFO L226 Difference]: Without dead ends: 4095 [2021-11-25 20:27:11,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=420, Invalid=1836, Unknown=0, NotChecked=0, Total=2256 [2021-11-25 20:27:11,014 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 643 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 7564 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 7564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:11,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 34 Invalid, 7611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 7564 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2021-11-25 20:27:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2021-11-25 20:27:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 2841. [2021-11-25 20:27:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2831 states have (on average 2.3196750264924053) internal successors, (6567), 2840 states have internal predecessors, (6567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 6567 transitions. [2021-11-25 20:27:11,049 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 6567 transitions. Word has length 20 [2021-11-25 20:27:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:11,049 INFO L470 AbstractCegarLoop]: Abstraction has 2841 states and 6567 transitions. [2021-11-25 20:27:11,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:27:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 6567 transitions. [2021-11-25 20:27:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:11,051 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:11,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:11,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-25 20:27:11,051 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash 105066800, now seen corresponding path program 5 times [2021-11-25 20:27:11,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:11,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955154971] [2021-11-25 20:27:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:11,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:13,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:13,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955154971] [2021-11-25 20:27:13,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955154971] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:13,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:13,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:27:13,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322955704] [2021-11-25 20:27:13,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:13,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:27:13,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:27:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:27:13,244 INFO L87 Difference]: Start difference. First operand 2841 states and 6567 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:27:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:21,487 INFO L93 Difference]: Finished difference Result 4073 states and 9319 transitions. [2021-11-25 20:27:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 20:27:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:27:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:21,492 INFO L225 Difference]: With dead ends: 4073 [2021-11-25 20:27:21,492 INFO L226 Difference]: Without dead ends: 4073 [2021-11-25 20:27:21,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=514, Invalid=1936, Unknown=0, NotChecked=0, Total=2450 [2021-11-25 20:27:21,493 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 884 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 5039 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 5039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:21,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 34 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 5039 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-11-25 20:27:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2021-11-25 20:27:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 2783. [2021-11-25 20:27:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2773 states have (on average 2.32023079697079) internal successors, (6434), 2782 states have internal predecessors, (6434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 6434 transitions. [2021-11-25 20:27:21,529 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 6434 transitions. Word has length 20 [2021-11-25 20:27:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:21,529 INFO L470 AbstractCegarLoop]: Abstraction has 2783 states and 6434 transitions. [2021-11-25 20:27:21,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:27:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 6434 transitions. [2021-11-25 20:27:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:21,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:21,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:21,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-25 20:27:21,531 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash 813568494, now seen corresponding path program 5 times [2021-11-25 20:27:21,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:21,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410554707] [2021-11-25 20:27:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:21,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:21,802 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:21,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410554707] [2021-11-25 20:27:21,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410554707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:21,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:21,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:27:21,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891144071] [2021-11-25 20:27:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:21,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:27:21,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:27:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:27:21,803 INFO L87 Difference]: Start difference. First operand 2783 states and 6434 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:24,180 INFO L93 Difference]: Finished difference Result 3952 states and 9050 transitions. [2021-11-25 20:27:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 20:27:24,181 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 [2021-11-25 20:27:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:24,185 INFO L225 Difference]: With dead ends: 3952 [2021-11-25 20:27:24,185 INFO L226 Difference]: Without dead ends: 3952 [2021-11-25 20:27:24,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=414, Invalid=1566, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 20:27:24,186 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1229 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:24,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1229 Valid, 22 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 20:27:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2021-11-25 20:27:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2783. [2021-11-25 20:27:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2773 states have (on average 2.32023079697079) internal successors, (6434), 2782 states have internal predecessors, (6434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 6434 transitions. [2021-11-25 20:27:24,222 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 6434 transitions. Word has length 20 [2021-11-25 20:27:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:24,222 INFO L470 AbstractCegarLoop]: Abstraction has 2783 states and 6434 transitions. [2021-11-25 20:27:24,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 6434 transitions. [2021-11-25 20:27:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:24,224 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:24,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:24,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-25 20:27:24,224 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 654412345, now seen corresponding path program 3 times [2021-11-25 20:27:24,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:24,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176847380] [2021-11-25 20:27:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:24,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:24,481 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:24,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176847380] [2021-11-25 20:27:24,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176847380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:24,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:24,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:27:24,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793493895] [2021-11-25 20:27:24,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:24,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:27:24,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:27:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:27:24,482 INFO L87 Difference]: Start difference. First operand 2783 states and 6434 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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) [2021-11-25 20:27:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:26,746 INFO L93 Difference]: Finished difference Result 7120 states and 16161 transitions. [2021-11-25 20:27:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 20:27:26,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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 [2021-11-25 20:27:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:26,755 INFO L225 Difference]: With dead ends: 7120 [2021-11-25 20:27:26,755 INFO L226 Difference]: Without dead ends: 7085 [2021-11-25 20:27:26,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2021-11-25 20:27:26,755 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 1349 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:26,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1349 Valid, 196 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 20:27:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2021-11-25 20:27:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 2797. [2021-11-25 20:27:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2787 states have (on average 2.3200574094007895) internal successors, (6466), 2796 states have internal predecessors, (6466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 6466 transitions. [2021-11-25 20:27:26,808 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 6466 transitions. Word has length 20 [2021-11-25 20:27:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:26,808 INFO L470 AbstractCegarLoop]: Abstraction has 2797 states and 6466 transitions. [2021-11-25 20:27:26,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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) [2021-11-25 20:27:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 6466 transitions. [2021-11-25 20:27:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:26,810 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:26,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:26,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-25 20:27:26,810 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash -17075080, now seen corresponding path program 6 times [2021-11-25 20:27:26,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:26,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407427807] [2021-11-25 20:27:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:26,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:27,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:27,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407427807] [2021-11-25 20:27:27,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407427807] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:27,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:27,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:27:27,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170192073] [2021-11-25 20:27:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:27,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:27:27,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:27:27,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:27:27,085 INFO L87 Difference]: Start difference. First operand 2797 states and 6466 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2021-11-25 20:27:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:30,640 INFO L93 Difference]: Finished difference Result 3998 states and 9146 transitions. [2021-11-25 20:27:30,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 20:27:30,646 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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 [2021-11-25 20:27:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:30,650 INFO L225 Difference]: With dead ends: 3998 [2021-11-25 20:27:30,650 INFO L226 Difference]: Without dead ends: 3998 [2021-11-25 20:27:30,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=414, Invalid=1146, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 20:27:30,651 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 639 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 4900 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:30,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 22 Invalid, 4946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4900 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-25 20:27:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2021-11-25 20:27:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 2812. [2021-11-25 20:27:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2802 states have (on average 2.3190578158458246) internal successors, (6498), 2811 states have internal predecessors, (6498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 6498 transitions. [2021-11-25 20:27:30,686 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 6498 transitions. Word has length 20 [2021-11-25 20:27:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:30,687 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 6498 transitions. [2021-11-25 20:27:30,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2021-11-25 20:27:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 6498 transitions. [2021-11-25 20:27:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:30,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:30,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:30,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-25 20:27:30,689 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:30,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1506613678, now seen corresponding path program 7 times [2021-11-25 20:27:30,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:30,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885208021] [2021-11-25 20:27:30,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:30,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:31,001 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:31,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885208021] [2021-11-25 20:27:31,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885208021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:31,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:31,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:27:31,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252032896] [2021-11-25 20:27:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:31,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:27:31,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:31,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:27:31,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:27:31,003 INFO L87 Difference]: Start difference. First operand 2812 states and 6498 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:34,583 INFO L93 Difference]: Finished difference Result 4251 states and 9759 transitions. [2021-11-25 20:27:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:27:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 [2021-11-25 20:27:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:34,589 INFO L225 Difference]: With dead ends: 4251 [2021-11-25 20:27:34,589 INFO L226 Difference]: Without dead ends: 4251 [2021-11-25 20:27:34,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=429, Invalid=1131, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 20:27:34,590 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 653 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 4380 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:34,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 22 Invalid, 4423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4380 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 20:27:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2021-11-25 20:27:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 2811. [2021-11-25 20:27:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 2801 states have (on average 2.3191717243841485) internal successors, (6496), 2810 states have internal predecessors, (6496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 6496 transitions. [2021-11-25 20:27:34,630 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 6496 transitions. Word has length 20 [2021-11-25 20:27:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:34,630 INFO L470 AbstractCegarLoop]: Abstraction has 2811 states and 6496 transitions. [2021-11-25 20:27:34,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 6496 transitions. [2021-11-25 20:27:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:34,632 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:34,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:34,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-25 20:27:34,633 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2054491808, now seen corresponding path program 8 times [2021-11-25 20:27:34,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:34,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508514739] [2021-11-25 20:27:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:34,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:34,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:34,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508514739] [2021-11-25 20:27:34,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508514739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:34,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:34,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:27:34,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498611949] [2021-11-25 20:27:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:34,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:27:34,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:34,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:27:34,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:27:34,918 INFO L87 Difference]: Start difference. First operand 2811 states and 6496 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:38,607 INFO L93 Difference]: Finished difference Result 5139 states and 11816 transitions. [2021-11-25 20:27:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:27:38,607 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 [2021-11-25 20:27:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:38,613 INFO L225 Difference]: With dead ends: 5139 [2021-11-25 20:27:38,613 INFO L226 Difference]: Without dead ends: 5139 [2021-11-25 20:27:38,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=584, Invalid=1486, Unknown=0, NotChecked=0, Total=2070 [2021-11-25 20:27:38,617 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 992 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 4062 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:38,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [992 Valid, 22 Invalid, 4103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4062 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:27:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2021-11-25 20:27:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 2898. [2021-11-25 20:27:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2888 states have (on average 2.317174515235457) internal successors, (6692), 2897 states have internal predecessors, (6692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 6692 transitions. [2021-11-25 20:27:38,661 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 6692 transitions. Word has length 20 [2021-11-25 20:27:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:38,661 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 6692 transitions. [2021-11-25 20:27:38,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 6692 transitions. [2021-11-25 20:27:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:38,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:38,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:38,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-25 20:27:38,663 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1920307518, now seen corresponding path program 9 times [2021-11-25 20:27:38,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359829939] [2021-11-25 20:27:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:38,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:38,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:38,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359829939] [2021-11-25 20:27:38,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359829939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:38,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:38,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:27:38,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582480017] [2021-11-25 20:27:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:38,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:27:38,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:27:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:27:38,892 INFO L87 Difference]: Start difference. First operand 2898 states and 6692 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:42,863 INFO L93 Difference]: Finished difference Result 4321 states and 9856 transitions. [2021-11-25 20:27:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-25 20:27:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 [2021-11-25 20:27:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:42,868 INFO L225 Difference]: With dead ends: 4321 [2021-11-25 20:27:42,868 INFO L226 Difference]: Without dead ends: 4321 [2021-11-25 20:27:42,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=657, Invalid=1695, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 20:27:42,868 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 859 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 4714 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:42,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 22 Invalid, 4758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4714 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-25 20:27:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2021-11-25 20:27:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 2898. [2021-11-25 20:27:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2888 states have (on average 2.317174515235457) internal successors, (6692), 2897 states have internal predecessors, (6692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 6692 transitions. [2021-11-25 20:27:42,906 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 6692 transitions. Word has length 20 [2021-11-25 20:27:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:42,906 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 6692 transitions. [2021-11-25 20:27:42,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 6692 transitions. [2021-11-25 20:27:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:42,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:42,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:42,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-25 20:27:42,908 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:42,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1063902700, now seen corresponding path program 10 times [2021-11-25 20:27:42,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:42,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683208323] [2021-11-25 20:27:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:42,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:43,280 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:43,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683208323] [2021-11-25 20:27:43,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683208323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:43,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:43,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 20:27:43,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686239697] [2021-11-25 20:27:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:43,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:27:43,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:27:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:27:43,282 INFO L87 Difference]: Start difference. First operand 2898 states and 6692 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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) [2021-11-25 20:27:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:45,585 INFO L93 Difference]: Finished difference Result 3460 states and 7884 transitions. [2021-11-25 20:27:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 20:27:45,585 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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 [2021-11-25 20:27:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:45,589 INFO L225 Difference]: With dead ends: 3460 [2021-11-25 20:27:45,590 INFO L226 Difference]: Without dead ends: 3460 [2021-11-25 20:27:45,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2021-11-25 20:27:45,590 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 499 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:45,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 11 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 20:27:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2021-11-25 20:27:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 2908. [2021-11-25 20:27:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2898 states have (on average 2.31608005521049) internal successors, (6712), 2907 states have internal predecessors, (6712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 6712 transitions. [2021-11-25 20:27:45,624 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 6712 transitions. Word has length 20 [2021-11-25 20:27:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:45,625 INFO L470 AbstractCegarLoop]: Abstraction has 2908 states and 6712 transitions. [2021-11-25 20:27:45,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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) [2021-11-25 20:27:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 6712 transitions. [2021-11-25 20:27:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:45,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:45,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:45,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-25 20:27:45,628 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:45,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1077971740, now seen corresponding path program 11 times [2021-11-25 20:27:45,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:45,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362312790] [2021-11-25 20:27:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:45,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:45,909 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362312790] [2021-11-25 20:27:45,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362312790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:45,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:45,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:27:45,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589071222] [2021-11-25 20:27:45,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:45,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:27:45,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:45,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:27:45,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:27:45,910 INFO L87 Difference]: Start difference. First operand 2908 states and 6712 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2021-11-25 20:27:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:48,772 INFO L93 Difference]: Finished difference Result 4168 states and 9517 transitions. [2021-11-25 20:27:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 20:27:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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 [2021-11-25 20:27:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:48,778 INFO L225 Difference]: With dead ends: 4168 [2021-11-25 20:27:48,778 INFO L226 Difference]: Without dead ends: 4168 [2021-11-25 20:27:48,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=1310, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 20:27:48,778 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 754 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 2978 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:48,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [754 Valid, 22 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2978 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 20:27:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2021-11-25 20:27:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 2911. [2021-11-25 20:27:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2901 states have (on average 2.3157531885556706) internal successors, (6718), 2910 states have internal predecessors, (6718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 6718 transitions. [2021-11-25 20:27:48,834 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 6718 transitions. Word has length 20 [2021-11-25 20:27:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:48,834 INFO L470 AbstractCegarLoop]: Abstraction has 2911 states and 6718 transitions. [2021-11-25 20:27:48,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2021-11-25 20:27:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 6718 transitions. [2021-11-25 20:27:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:48,837 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:48,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:48,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-25 20:27:48,837 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash 459786058, now seen corresponding path program 12 times [2021-11-25 20:27:48,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:48,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022602462] [2021-11-25 20:27:48,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:48,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:49,098 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:49,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022602462] [2021-11-25 20:27:49,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022602462] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:49,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:49,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:27:49,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600941304] [2021-11-25 20:27:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:49,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:27:49,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:49,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:27:49,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:27:49,099 INFO L87 Difference]: Start difference. First operand 2911 states and 6718 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:27:52,103 INFO L93 Difference]: Finished difference Result 4563 states and 10456 transitions. [2021-11-25 20:27:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 20:27:52,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 [2021-11-25 20:27:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:27:52,109 INFO L225 Difference]: With dead ends: 4563 [2021-11-25 20:27:52,109 INFO L226 Difference]: Without dead ends: 4563 [2021-11-25 20:27:52,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 20:27:52,110 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 816 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:27:52,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 22 Invalid, 3587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3530 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 20:27:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2021-11-25 20:27:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 2871. [2021-11-25 20:27:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2861 states have (on average 2.316322963998602) internal successors, (6627), 2870 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:27:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 6627 transitions. [2021-11-25 20:27:52,148 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 6627 transitions. Word has length 20 [2021-11-25 20:27:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:27:52,148 INFO L470 AbstractCegarLoop]: Abstraction has 2871 states and 6627 transitions. [2021-11-25 20:27:52,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2021-11-25 20:27:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 6627 transitions. [2021-11-25 20:27:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:27:52,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:27:52,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:27:52,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-25 20:27:52,150 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:27:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:27:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash -247937146, now seen corresponding path program 6 times [2021-11-25 20:27:52,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:27:52,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647656777] [2021-11-25 20:27:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:27:52,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:27:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:27:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:27:55,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:27:55,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647656777] [2021-11-25 20:27:55,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647656777] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:27:55,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:27:55,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:27:55,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619873611] [2021-11-25 20:27:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:27:55,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:27:55,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:27:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:27:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:27:55,307 INFO L87 Difference]: Start difference. First operand 2871 states and 6627 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:28:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:06,376 INFO L93 Difference]: Finished difference Result 3815 states and 8714 transitions. [2021-11-25 20:28:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 20:28:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:28:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:06,381 INFO L225 Difference]: With dead ends: 3815 [2021-11-25 20:28:06,381 INFO L226 Difference]: Without dead ends: 3815 [2021-11-25 20:28:06,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=431, Invalid=1921, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 20:28:06,381 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 768 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 5909 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 5909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:06,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 35 Invalid, 5955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 5909 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2021-11-25 20:28:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2021-11-25 20:28:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 2893. [2021-11-25 20:28:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2883 states have (on average 2.315296566077003) internal successors, (6675), 2892 states have internal predecessors, (6675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 6675 transitions. [2021-11-25 20:28:06,433 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 6675 transitions. Word has length 20 [2021-11-25 20:28:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:06,433 INFO L470 AbstractCegarLoop]: Abstraction has 2893 states and 6675 transitions. [2021-11-25 20:28:06,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:28:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 6675 transitions. [2021-11-25 20:28:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:28:06,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:06,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:06,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-25 20:28:06,436 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:28:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -641748782, now seen corresponding path program 7 times [2021-11-25 20:28:06,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:28:06,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313727730] [2021-11-25 20:28:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:06,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:28:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:11,093 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:28:11,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313727730] [2021-11-25 20:28:11,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313727730] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:11,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:11,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:28:11,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426469972] [2021-11-25 20:28:11,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:11,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:28:11,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:28:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:28:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:28:11,095 INFO L87 Difference]: Start difference. First operand 2893 states and 6675 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:28:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:22,874 INFO L93 Difference]: Finished difference Result 4161 states and 9505 transitions. [2021-11-25 20:28:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:28:22,874 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:28:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:22,878 INFO L225 Difference]: With dead ends: 4161 [2021-11-25 20:28:22,879 INFO L226 Difference]: Without dead ends: 4161 [2021-11-25 20:28:22,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=418, Invalid=1934, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 20:28:22,879 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 789 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 7175 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 7219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 7175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:22,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 35 Invalid, 7219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 7175 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2021-11-25 20:28:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2021-11-25 20:28:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 2871. [2021-11-25 20:28:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2861 states have (on average 2.316322963998602) internal successors, (6627), 2870 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 6627 transitions. [2021-11-25 20:28:22,914 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 6627 transitions. Word has length 20 [2021-11-25 20:28:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:22,914 INFO L470 AbstractCegarLoop]: Abstraction has 2871 states and 6627 transitions. [2021-11-25 20:28:22,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:28:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 6627 transitions. [2021-11-25 20:28:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:28:22,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:22,916 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:22,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-25 20:28:22,916 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:28:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1840037212, now seen corresponding path program 4 times [2021-11-25 20:28:22,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:28:22,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378356964] [2021-11-25 20:28:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:22,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:28:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:23,235 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:28:23,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378356964] [2021-11-25 20:28:23,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378356964] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:28:23,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350104435] [2021-11-25 20:28:23,236 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:28:23,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:28:23,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:28:23,241 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:28:23,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 20:28:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:23,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 117 conjunts are in the unsatisfiable core [2021-11-25 20:28:23,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:23,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2021-11-25 20:28:23,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2021-11-25 20:28:23,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2021-11-25 20:28:23,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2021-11-25 20:28:23,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2021-11-25 20:28:23,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 43 [2021-11-25 20:28:23,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 34 [2021-11-25 20:28:23,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:28:23,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:23,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2021-11-25 20:28:24,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:24,221 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-25 20:28:24,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 18 [2021-11-25 20:28:24,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:28:24,289 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-25 20:28:24,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 43 [2021-11-25 20:28:24,355 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:28:24,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-11-25 20:28:24,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2021-11-25 20:28:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:24,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:24,482 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6504 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6504) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:24,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6503)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6504) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:24,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_6503)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6504) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2021-11-25 20:28:24,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_6503)) .cse0 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:24,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) 12)) v_ArrVal_6503)) .cse0 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:24,540 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= 0 (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1) 12)) v_ArrVal_6503)) .cse0 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2021-11-25 20:28:24,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) 12)) v_ArrVal_6503)) .cse0 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-25 20:28:24,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350104435] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:28:24,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [635913480] [2021-11-25 20:28:24,556 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:28:24,557 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:28:24,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2021-11-25 20:28:24,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509286917] [2021-11-25 20:28:24,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:28:24,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 20:28:24,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:28:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 20:28:24,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=469, Unknown=7, NotChecked=350, Total=930 [2021-11-25 20:28:24,559 INFO L87 Difference]: Start difference. First operand 2871 states and 6627 transitions. Second operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:26,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse7 4)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse2 4) 12))) (.cse3 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 .cse1) (= (select .cse2 .cse3) 0) (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse5 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse5))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse5) 12)) v_ArrVal_6503)) .cse4 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse6 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 12) 4) (not (= .cse6 0)) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (= (select .cse7 .cse3) .cse6))))) is different from false [2021-11-25 20:28:28,764 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|))) (let ((.cse0 (select .cse2 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) 4) 12)))) (and (= .cse0 .cse1) (not (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (< (+ .cse4 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 12) 4) (not (= .cse4 0)) (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= 0 (select (select (let ((.cse6 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse6) 12)) v_ArrVal_6503)) .cse5 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (= (select .cse7 .cse3) .cse4) (not (= |c_pusherThread1of1ForFork0_#in~q_#1.base| .cse1)) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0))))) is different from false [2021-11-25 20:28:30,771 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse4 (select .cse0 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) 4) 12))) (.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse2 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (not (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse2 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 12) 4) (not (= .cse2 0)) (not (= .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= .cse3 .cse4) (= (select .cse5 .cse1) .cse2) (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse7 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse6) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) 12)) v_ArrVal_6503)) .cse6 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0))))) is different from false [2021-11-25 20:28:32,795 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12))) (.cse5 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_6503)) .cse0 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select .cse2 .cse3) |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (= .cse4 |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse5) 0) (not (= .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse6 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 12) 4) (not (= .cse6 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select .cse7 .cse5) .cse6) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))))) is different from false [2021-11-25 20:28:34,803 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse3 (select .cse4 .cse8))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8)))) (.cse5 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_6503)) .cse0 v_ArrVal_6504))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (= .cse2 .cse3) (not (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse6 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 12) 4) (not (= .cse6 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select .cse7 .cse5) .cse6))))) is different from false [2021-11-25 20:28:36,822 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse3 .cse4))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse1 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 12) 4) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_6503)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6504) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse2 .cse1) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= .cse2 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) is different from false [2021-11-25 20:28:38,832 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)))) (and (forall ((v_ArrVal_6503 Int) (v_ArrVal_6504 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6503)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6504) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (= 4 |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (< (+ .cse0 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (not (= .cse0 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= .cse1 .cse0) (= .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) is different from false [2021-11-25 20:28:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:39,455 INFO L93 Difference]: Finished difference Result 3270 states and 7601 transitions. [2021-11-25 20:28:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 20:28:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 20:28:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:39,459 INFO L225 Difference]: With dead ends: 3270 [2021-11-25 20:28:39,459 INFO L226 Difference]: Without dead ends: 3270 [2021-11-25 20:28:39,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=130, Invalid=562, Unknown=14, NotChecked=854, Total=1560 [2021-11-25 20:28:39,460 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 95 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 950 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:39,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 44 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1085 Invalid, 0 Unknown, 950 Unchecked, 0.8s Time] [2021-11-25 20:28:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2021-11-25 20:28:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2904. [2021-11-25 20:28:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2904 states, 2894 states have (on average 2.316516931582585) internal successors, (6704), 2903 states have internal predecessors, (6704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 6704 transitions. [2021-11-25 20:28:39,493 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 6704 transitions. Word has length 20 [2021-11-25 20:28:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:39,493 INFO L470 AbstractCegarLoop]: Abstraction has 2904 states and 6704 transitions. [2021-11-25 20:28:39,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 6704 transitions. [2021-11-25 20:28:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:28:39,495 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:39,495 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:39,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:39,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:28:39,695 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:28:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1840385032, now seen corresponding path program 5 times [2021-11-25 20:28:39,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:28:39,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777048906] [2021-11-25 20:28:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:39,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:28:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:40,192 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:28:40,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777048906] [2021-11-25 20:28:40,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777048906] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:28:40,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760516673] [2021-11-25 20:28:40,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:28:40,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:28:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:28:40,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:28:40,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 20:28:40,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:28:40,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:28:40,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 127 conjunts are in the unsatisfiable core [2021-11-25 20:28:40,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:28:40,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 20:28:40,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2021-11-25 20:28:40,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2021-11-25 20:28:40,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2021-11-25 20:28:40,885 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 20:28:40,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 93 [2021-11-25 20:28:40,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2021-11-25 20:28:40,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:40,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:28:40,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 52 [2021-11-25 20:28:41,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:28:41,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 10 [2021-11-25 20:28:41,413 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 20:28:41,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 82 [2021-11-25 20:28:41,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-11-25 20:28:41,506 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:28:41,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-11-25 20:28:41,636 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:28:41,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 16 [2021-11-25 20:28:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:41,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:28:41,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6699 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6699) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:41,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6698 (Array Int Int)) (v_ArrVal_6699 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_6698) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6699) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2021-11-25 20:28:41,690 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6698 (Array Int Int)) (v_ArrVal_6699 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_6698) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6699) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:41,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6698 (Array Int Int)) (v_ArrVal_6699 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_6698) .cse0 v_ArrVal_6699))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:41,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6698 (Array Int Int)) (v_ArrVal_6699 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) 12)) v_ArrVal_6698) .cse0 v_ArrVal_6699))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:41,727 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6698 (Array Int Int)) (v_ArrVal_6699 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1) 12)) v_ArrVal_6698) .cse0 v_ArrVal_6699))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:28:41,741 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6698 (Array Int Int)) (v_ArrVal_6699 (Array Int Int))) (not (= 0 (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) 12)) v_ArrVal_6698) .cse0 v_ArrVal_6699))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2021-11-25 20:28:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-25 20:28:41,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760516673] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:28:41,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1314406279] [2021-11-25 20:28:41,744 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:28:41,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:28:41,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2021-11-25 20:28:41,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66131014] [2021-11-25 20:28:41,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:28:41,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 20:28:41,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:28:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 20:28:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=431, Unknown=7, NotChecked=336, Total=870 [2021-11-25 20:28:41,747 INFO L87 Difference]: Start difference. First operand 2904 states and 6704 transitions. Second operand has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:44,016 INFO L93 Difference]: Finished difference Result 4179 states and 9649 transitions. [2021-11-25 20:28:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 20:28:44,017 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 20:28:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:44,022 INFO L225 Difference]: With dead ends: 4179 [2021-11-25 20:28:44,022 INFO L226 Difference]: Without dead ends: 4179 [2021-11-25 20:28:44,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=240, Invalid=1041, Unknown=7, NotChecked=518, Total=1806 [2021-11-25 20:28:44,023 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 163 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1324 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:44,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 35 Invalid, 2988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1646 Invalid, 0 Unknown, 1324 Unchecked, 1.3s Time] [2021-11-25 20:28:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2021-11-25 20:28:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 3063. [2021-11-25 20:28:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 3053 states have (on average 2.3177202751392074) internal successors, (7076), 3062 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7076 transitions. [2021-11-25 20:28:44,063 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7076 transitions. Word has length 20 [2021-11-25 20:28:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:44,064 INFO L470 AbstractCegarLoop]: Abstraction has 3063 states and 7076 transitions. [2021-11-25 20:28:44,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7076 transitions. [2021-11-25 20:28:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:28:44,065 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:44,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:44,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:28:44,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:28:44,266 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:28:44,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash 663493322, now seen corresponding path program 8 times [2021-11-25 20:28:44,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:28:44,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389110718] [2021-11-25 20:28:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:44,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:28:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:45,886 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:28:45,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389110718] [2021-11-25 20:28:45,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389110718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:45,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:45,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 20:28:45,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494022134] [2021-11-25 20:28:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:45,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 20:28:45,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:28:45,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 20:28:45,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-25 20:28:45,887 INFO L87 Difference]: Start difference. First operand 3063 states and 7076 transitions. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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) [2021-11-25 20:28:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:28:57,135 INFO L93 Difference]: Finished difference Result 5214 states and 11898 transitions. [2021-11-25 20:28:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-25 20:28:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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 [2021-11-25 20:28:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:28:57,140 INFO L225 Difference]: With dead ends: 5214 [2021-11-25 20:28:57,140 INFO L226 Difference]: Without dead ends: 5214 [2021-11-25 20:28:57,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=646, Invalid=2434, Unknown=0, NotChecked=0, Total=3080 [2021-11-25 20:28:57,141 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 733 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 8032 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 8032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:28:57,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 24 Invalid, 8103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 8032 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2021-11-25 20:28:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5214 states. [2021-11-25 20:28:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5214 to 3209. [2021-11-25 20:28:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 3199 states have (on average 2.3219756173804313) internal successors, (7428), 3208 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:28:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 7428 transitions. [2021-11-25 20:28:57,185 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 7428 transitions. Word has length 20 [2021-11-25 20:28:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:28:57,185 INFO L470 AbstractCegarLoop]: Abstraction has 3209 states and 7428 transitions. [2021-11-25 20:28:57,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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) [2021-11-25 20:28:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 7428 transitions. [2021-11-25 20:28:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:28:57,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:28:57,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:28:57,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-25 20:28:57,187 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:28:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:28:57,187 INFO L85 PathProgramCache]: Analyzing trace with hash 269681686, now seen corresponding path program 9 times [2021-11-25 20:28:57,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:28:57,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861423043] [2021-11-25 20:28:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:28:57,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:28:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:28:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:28:59,423 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:28:59,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861423043] [2021-11-25 20:28:59,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861423043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:28:59,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:28:59,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:28:59,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874532507] [2021-11-25 20:28:59,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:28:59,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:28:59,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:28:59,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:28:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:28:59,424 INFO L87 Difference]: Start difference. First operand 3209 states and 7428 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:29:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:10,473 INFO L93 Difference]: Finished difference Result 5384 states and 12328 transitions. [2021-11-25 20:29:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 20:29:10,474 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:29:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:10,479 INFO L225 Difference]: With dead ends: 5384 [2021-11-25 20:29:10,479 INFO L226 Difference]: Without dead ends: 5384 [2021-11-25 20:29:10,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2021-11-25 20:29:10,480 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 903 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 7094 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 7094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:10,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 24 Invalid, 7159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 7094 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2021-11-25 20:29:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2021-11-25 20:29:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 3188. [2021-11-25 20:29:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3188 states, 3178 states have (on average 2.3231592196349906) internal successors, (7383), 3187 states have internal predecessors, (7383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 7383 transitions. [2021-11-25 20:29:10,524 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 7383 transitions. Word has length 20 [2021-11-25 20:29:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:10,524 INFO L470 AbstractCegarLoop]: Abstraction has 3188 states and 7383 transitions. [2021-11-25 20:29:10,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:29:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 7383 transitions. [2021-11-25 20:29:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:29:10,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:10,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:29:10,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-25 20:29:10,526 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:29:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:10,526 INFO L85 PathProgramCache]: Analyzing trace with hash -998762342, now seen corresponding path program 10 times [2021-11-25 20:29:10,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:29:10,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041157000] [2021-11-25 20:29:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:10,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:29:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:11,553 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:29:11,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041157000] [2021-11-25 20:29:11,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041157000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:29:11,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:29:11,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:29:11,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686113764] [2021-11-25 20:29:11,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:29:11,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:29:11,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:29:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:29:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:29:11,554 INFO L87 Difference]: Start difference. First operand 3188 states and 7383 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:29:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:21,012 INFO L93 Difference]: Finished difference Result 5395 states and 12292 transitions. [2021-11-25 20:29:21,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-25 20:29:21,013 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:29:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:21,018 INFO L225 Difference]: With dead ends: 5395 [2021-11-25 20:29:21,019 INFO L226 Difference]: Without dead ends: 5395 [2021-11-25 20:29:21,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=685, Invalid=2621, Unknown=0, NotChecked=0, Total=3306 [2021-11-25 20:29:21,019 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 831 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 7525 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 7577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 7525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:21,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [831 Valid, 35 Invalid, 7577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 7525 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2021-11-25 20:29:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2021-11-25 20:29:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 3230. [2021-11-25 20:29:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3230 states, 3220 states have (on average 2.3232919254658384) internal successors, (7481), 3229 states have internal predecessors, (7481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 7481 transitions. [2021-11-25 20:29:21,091 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 7481 transitions. Word has length 20 [2021-11-25 20:29:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:21,091 INFO L470 AbstractCegarLoop]: Abstraction has 3230 states and 7481 transitions. [2021-11-25 20:29:21,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:29:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 7481 transitions. [2021-11-25 20:29:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:29:21,094 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:21,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:29:21,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-25 20:29:21,095 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:29:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash 757673760, now seen corresponding path program 11 times [2021-11-25 20:29:21,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:29:21,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608409187] [2021-11-25 20:29:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:21,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:29:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:23,333 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:29:23,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608409187] [2021-11-25 20:29:23,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608409187] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:29:23,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:29:23,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:29:23,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741368906] [2021-11-25 20:29:23,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:29:23,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:29:23,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:29:23,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:29:23,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:29:23,335 INFO L87 Difference]: Start difference. First operand 3230 states and 7481 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:29:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:33,264 INFO L93 Difference]: Finished difference Result 4800 states and 10952 transitions. [2021-11-25 20:29:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 20:29:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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 [2021-11-25 20:29:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:33,270 INFO L225 Difference]: With dead ends: 4800 [2021-11-25 20:29:33,270 INFO L226 Difference]: Without dead ends: 4800 [2021-11-25 20:29:33,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=465, Invalid=1887, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 20:29:33,270 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 760 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 6723 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 6767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 6723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:33,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 24 Invalid, 6767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 6723 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2021-11-25 20:29:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2021-11-25 20:29:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 3251. [2021-11-25 20:29:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 3241 states have (on average 2.322431348349275) internal successors, (7527), 3250 states have internal predecessors, (7527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 7527 transitions. [2021-11-25 20:29:33,313 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 7527 transitions. Word has length 20 [2021-11-25 20:29:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:33,313 INFO L470 AbstractCegarLoop]: Abstraction has 3251 states and 7527 transitions. [2021-11-25 20:29:33,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2021-11-25 20:29:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 7527 transitions. [2021-11-25 20:29:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:29:33,315 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:33,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:29:33,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-25 20:29:33,315 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:29:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash 363862124, now seen corresponding path program 12 times [2021-11-25 20:29:33,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:29:33,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789323085] [2021-11-25 20:29:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:33,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:29:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:34,071 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:29:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789323085] [2021-11-25 20:29:34,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789323085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:29:34,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:29:34,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:29:34,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254984909] [2021-11-25 20:29:34,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:29:34,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:29:34,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:29:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:29:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:29:34,072 INFO L87 Difference]: Start difference. First operand 3251 states and 7527 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2021-11-25 20:29:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:38,985 INFO L93 Difference]: Finished difference Result 4923 states and 11296 transitions. [2021-11-25 20:29:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 20:29:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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 [2021-11-25 20:29:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:38,991 INFO L225 Difference]: With dead ends: 4923 [2021-11-25 20:29:38,991 INFO L226 Difference]: Without dead ends: 4923 [2021-11-25 20:29:38,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=403, Invalid=1319, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 20:29:38,992 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 898 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 4630 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 4677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:38,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [898 Valid, 35 Invalid, 4677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4630 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-25 20:29:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4923 states. [2021-11-25 20:29:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4923 to 3209. [2021-11-25 20:29:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 3199 states have (on average 2.324476398874648) internal successors, (7436), 3208 states have internal predecessors, (7436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 7436 transitions. [2021-11-25 20:29:39,035 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 7436 transitions. Word has length 20 [2021-11-25 20:29:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:39,035 INFO L470 AbstractCegarLoop]: Abstraction has 3209 states and 7436 transitions. [2021-11-25 20:29:39,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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) [2021-11-25 20:29:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 7436 transitions. [2021-11-25 20:29:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:29:39,037 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:39,037 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:29:39,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-25 20:29:39,037 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:29:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash 578546546, now seen corresponding path program 6 times [2021-11-25 20:29:39,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:29:39,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472388048] [2021-11-25 20:29:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:39,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:29:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:39,418 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:29:39,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472388048] [2021-11-25 20:29:39,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472388048] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:29:39,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120659720] [2021-11-25 20:29:39,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:29:39,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:29:39,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:29:39,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:29:39,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 20:29:39,854 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:29:39,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:29:39,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 115 conjunts are in the unsatisfiable core [2021-11-25 20:29:39,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:29:39,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 20:29:39,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2021-11-25 20:29:39,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:29:39,962 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 20:29:39,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 118 [2021-11-25 20:29:39,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:39,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2021-11-25 20:29:40,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 83 treesize of output 59 [2021-11-25 20:29:40,458 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 20:29:40,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 88 [2021-11-25 20:29:40,464 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-25 20:29:40,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 22 [2021-11-25 20:29:40,524 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:29:40,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-11-25 20:29:40,654 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:29:40,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 16 [2021-11-25 20:29:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:40,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:29:40,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7329 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7329) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:40,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7329 (Array Int Int)) (v_ArrVal_7328 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_7328) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7329) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:40,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7329 (Array Int Int)) (v_ArrVal_7328 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7328) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7329) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:40,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7329 (Array Int Int)) (v_ArrVal_7328 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_7328) .cse0 v_ArrVal_7329))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:40,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7329 (Array Int Int)) (v_ArrVal_7328 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) 12)) v_ArrVal_7328) .cse0 v_ArrVal_7329))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:40,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7329 (Array Int Int)) (v_ArrVal_7328 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1) 12)) v_ArrVal_7328) .cse0 v_ArrVal_7329))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:40,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7329 (Array Int Int)) (v_ArrVal_7328 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) 12)) v_ArrVal_7328) .cse0 v_ArrVal_7329))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-25 20:29:40,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120659720] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:29:40,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [816051264] [2021-11-25 20:29:40,756 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:29:40,758 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:29:40,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2021-11-25 20:29:40,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59291179] [2021-11-25 20:29:40,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:29:40,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 20:29:40,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:29:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 20:29:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=429, Unknown=7, NotChecked=336, Total=870 [2021-11-25 20:29:40,759 INFO L87 Difference]: Start difference. First operand 3209 states and 7436 transitions. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:45,008 INFO L93 Difference]: Finished difference Result 5115 states and 11830 transitions. [2021-11-25 20:29:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 20:29:45,008 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 20:29:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:45,014 INFO L225 Difference]: With dead ends: 5115 [2021-11-25 20:29:45,014 INFO L226 Difference]: Without dead ends: 5115 [2021-11-25 20:29:45,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=554, Invalid=2437, Unknown=7, NotChecked=784, Total=3782 [2021-11-25 20:29:45,014 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 1572 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2596 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:45,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1572 Valid, 44 Invalid, 5432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2808 Invalid, 0 Unknown, 2596 Unchecked, 2.1s Time] [2021-11-25 20:29:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2021-11-25 20:29:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 3216. [2021-11-25 20:29:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3206 states have (on average 2.3243917654398003) internal successors, (7452), 3215 states have internal predecessors, (7452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 7452 transitions. [2021-11-25 20:29:45,057 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 7452 transitions. Word has length 20 [2021-11-25 20:29:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:45,058 INFO L470 AbstractCegarLoop]: Abstraction has 3216 states and 7452 transitions. [2021-11-25 20:29:45,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 7452 transitions. [2021-11-25 20:29:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 20:29:45,060 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:45,060 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:29:45,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-25 20:29:45,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:29:45,263 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:29:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 578198726, now seen corresponding path program 7 times [2021-11-25 20:29:45,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:29:45,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886380696] [2021-11-25 20:29:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:45,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:29:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:45,603 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:29:45,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886380696] [2021-11-25 20:29:45,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886380696] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:29:45,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152037463] [2021-11-25 20:29:45,603 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:29:45,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:29:45,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:29:45,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:29:45,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 20:29:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:46,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 116 conjunts are in the unsatisfiable core [2021-11-25 20:29:46,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:29:46,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 20:29:46,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2021-11-25 20:29:46,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:29:46,233 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 20:29:46,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 104 [2021-11-25 20:29:46,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:29:46,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2021-11-25 20:29:46,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2021-11-25 20:29:46,758 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 20:29:46,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 97 treesize of output 78 [2021-11-25 20:29:46,764 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-25 20:29:46,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2021-11-25 20:29:46,832 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 20:29:46,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2021-11-25 20:29:46,981 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:29:46,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 16 [2021-11-25 20:29:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:46,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:29:47,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7521 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7521) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:47,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7521 (Array Int Int)) (v_ArrVal_7520 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_7520) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7521) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:47,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7521 (Array Int Int)) (v_ArrVal_7520 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7520) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7521) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:47,024 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7521 (Array Int Int)) (v_ArrVal_7520 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) v_ArrVal_7520) .cse0 v_ArrVal_7521))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:47,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7521 (Array Int Int)) (v_ArrVal_7520 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) 12)) v_ArrVal_7520) .cse0 v_ArrVal_7521))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:47,048 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7521 (Array Int Int)) (v_ArrVal_7520 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1) 12)) v_ArrVal_7520) .cse0 v_ArrVal_7521))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:47,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7521 (Array Int Int)) (v_ArrVal_7520 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) 12)) v_ArrVal_7520) .cse0 v_ArrVal_7521))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 20:29:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-25 20:29:47,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152037463] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:29:47,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1158165931] [2021-11-25 20:29:47,057 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:29:47,058 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:29:47,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2021-11-25 20:29:47,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084922245] [2021-11-25 20:29:47,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:29:47,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 20:29:47,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:29:47,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 20:29:47,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=422, Unknown=7, NotChecked=336, Total=870 [2021-11-25 20:29:47,059 INFO L87 Difference]: Start difference. First operand 3216 states and 7452 transitions. Second operand has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:51,725 INFO L93 Difference]: Finished difference Result 5753 states and 13283 transitions. [2021-11-25 20:29:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 20:29:51,726 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 20:29:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:51,732 INFO L225 Difference]: With dead ends: 5753 [2021-11-25 20:29:51,732 INFO L226 Difference]: Without dead ends: 5753 [2021-11-25 20:29:51,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=519, Invalid=1952, Unknown=7, NotChecked=714, Total=3192 [2021-11-25 20:29:51,732 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 1034 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 4078 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 7820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3695 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:51,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1034 Valid, 35 Invalid, 7820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4078 Invalid, 0 Unknown, 3695 Unchecked, 2.9s Time] [2021-11-25 20:29:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2021-11-25 20:29:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 3249. [2021-11-25 20:29:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3249 states, 3239 states have (on average 2.3352886693423898) internal successors, (7564), 3248 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 7564 transitions. [2021-11-25 20:29:51,788 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 7564 transitions. Word has length 20 [2021-11-25 20:29:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:51,788 INFO L470 AbstractCegarLoop]: Abstraction has 3249 states and 7564 transitions. [2021-11-25 20:29:51,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 7564 transitions. [2021-11-25 20:29:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:29:51,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:51,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:29:51,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 20:29:51,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-11-25 20:29:51,990 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:29:51,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 523512330, now seen corresponding path program 1 times [2021-11-25 20:29:51,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:29:51,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829441868] [2021-11-25 20:29:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:51,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:29:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:52,323 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:29:52,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829441868] [2021-11-25 20:29:52,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829441868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:29:52,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:29:52,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:29:52,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2219189] [2021-11-25 20:29:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:29:52,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:29:52,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:29:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:29:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:29:52,324 INFO L87 Difference]: Start difference. First operand 3249 states and 7564 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:29:55,983 INFO L93 Difference]: Finished difference Result 8611 states and 19429 transitions. [2021-11-25 20:29:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:29:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:29:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:29:55,998 INFO L225 Difference]: With dead ends: 8611 [2021-11-25 20:29:55,999 INFO L226 Difference]: Without dead ends: 8563 [2021-11-25 20:29:55,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=531, Invalid=1361, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 20:29:56,000 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1188 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:29:56,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 98 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 20:29:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2021-11-25 20:29:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 3308. [2021-11-25 20:29:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3298 states have (on average 2.332929047907823) internal successors, (7694), 3307 states have internal predecessors, (7694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 7694 transitions. [2021-11-25 20:29:56,075 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 7694 transitions. Word has length 21 [2021-11-25 20:29:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:29:56,076 INFO L470 AbstractCegarLoop]: Abstraction has 3308 states and 7694 transitions. [2021-11-25 20:29:56,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:29:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 7694 transitions. [2021-11-25 20:29:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:29:56,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:29:56,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:29:56,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-25 20:29:56,078 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:29:56,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:29:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1498479326, now seen corresponding path program 2 times [2021-11-25 20:29:56,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:29:56,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743418364] [2021-11-25 20:29:56,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:29:56,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:29:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:29:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:29:56,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:29:56,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743418364] [2021-11-25 20:29:56,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743418364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:29:56,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:29:56,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:29:56,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407224964] [2021-11-25 20:29:56,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:29:56,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:29:56,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:29:56,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:29:56,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:29:56,406 INFO L87 Difference]: Start difference. First operand 3308 states and 7694 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:30:00,740 INFO L93 Difference]: Finished difference Result 8981 states and 20227 transitions. [2021-11-25 20:30:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 20:30:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:30:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:30:00,752 INFO L225 Difference]: With dead ends: 8981 [2021-11-25 20:30:00,752 INFO L226 Difference]: Without dead ends: 8939 [2021-11-25 20:30:00,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2021-11-25 20:30:00,752 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 1328 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3387 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 3387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:30:00,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1328 Valid, 89 Invalid, 3539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 3387 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 20:30:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8939 states. [2021-11-25 20:30:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8939 to 3332. [2021-11-25 20:30:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3322 states have (on average 2.3332329921733894) internal successors, (7751), 3331 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 7751 transitions. [2021-11-25 20:30:00,854 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 7751 transitions. Word has length 21 [2021-11-25 20:30:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:30:00,855 INFO L470 AbstractCegarLoop]: Abstraction has 3332 states and 7751 transitions. [2021-11-25 20:30:00,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 7751 transitions. [2021-11-25 20:30:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:30:00,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:30:00,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:30:00,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-25 20:30:00,858 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:30:00,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:30:00,858 INFO L85 PathProgramCache]: Analyzing trace with hash -286405738, now seen corresponding path program 1 times [2021-11-25 20:30:00,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:30:00,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341509336] [2021-11-25 20:30:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:30:00,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:30:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:30:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:30:02,657 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:30:02,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341509336] [2021-11-25 20:30:02,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341509336] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:30:02,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:30:02,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:30:02,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925333068] [2021-11-25 20:30:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:30:02,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:30:02,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:30:02,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:30:02,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:30:02,658 INFO L87 Difference]: Start difference. First operand 3332 states and 7751 transitions. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:30:11,627 INFO L93 Difference]: Finished difference Result 5186 states and 11874 transitions. [2021-11-25 20:30:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 20:30:11,627 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:30:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:30:11,633 INFO L225 Difference]: With dead ends: 5186 [2021-11-25 20:30:11,633 INFO L226 Difference]: Without dead ends: 5186 [2021-11-25 20:30:11,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=415, Invalid=1655, Unknown=0, NotChecked=0, Total=2070 [2021-11-25 20:30:11,633 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 678 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 6125 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 6212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 6125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:30:11,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [678 Valid, 24 Invalid, 6212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 6125 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2021-11-25 20:30:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2021-11-25 20:30:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 3339. [2021-11-25 20:30:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3339 states, 3329 states have (on average 2.3334334635025535) internal successors, (7768), 3338 states have internal predecessors, (7768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 7768 transitions. [2021-11-25 20:30:11,678 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 7768 transitions. Word has length 21 [2021-11-25 20:30:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:30:11,679 INFO L470 AbstractCegarLoop]: Abstraction has 3339 states and 7768 transitions. [2021-11-25 20:30:11,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 7768 transitions. [2021-11-25 20:30:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:30:11,681 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:30:11,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:30:11,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-11-25 20:30:11,681 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:30:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:30:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash 698122332, now seen corresponding path program 2 times [2021-11-25 20:30:11,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:30:11,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305204822] [2021-11-25 20:30:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:30:11,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:30:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:30:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:30:12,881 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:30:12,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305204822] [2021-11-25 20:30:12,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305204822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:30:12,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:30:12,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 20:30:12,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164972272] [2021-11-25 20:30:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:30:12,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 20:30:12,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:30:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 20:30:12,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-11-25 20:30:12,882 INFO L87 Difference]: Start difference. First operand 3339 states and 7768 transitions. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:30:20,212 INFO L93 Difference]: Finished difference Result 5452 states and 12518 transitions. [2021-11-25 20:30:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:30:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:30:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:30:20,218 INFO L225 Difference]: With dead ends: 5452 [2021-11-25 20:30:20,219 INFO L226 Difference]: Without dead ends: 5452 [2021-11-25 20:30:20,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=386, Invalid=1776, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 20:30:20,219 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 830 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 6119 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 6119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:30:20,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [830 Valid, 35 Invalid, 6170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 6119 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2021-11-25 20:30:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2021-11-25 20:30:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 3318. [2021-11-25 20:30:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 3308 states have (on average 2.3319226118500604) internal successors, (7714), 3317 states have internal predecessors, (7714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 7714 transitions. [2021-11-25 20:30:20,265 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 7714 transitions. Word has length 21 [2021-11-25 20:30:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:30:20,265 INFO L470 AbstractCegarLoop]: Abstraction has 3318 states and 7714 transitions. [2021-11-25 20:30:20,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 7714 transitions. [2021-11-25 20:30:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:30:20,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:30:20,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:30:20,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-25 20:30:20,267 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:30:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:30:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1067847990, now seen corresponding path program 1 times [2021-11-25 20:30:20,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:30:20,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425136126] [2021-11-25 20:30:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:30:20,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:30:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:30:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:30:20,711 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:30:20,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425136126] [2021-11-25 20:30:20,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425136126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:30:20,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:30:20,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:30:20,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013218285] [2021-11-25 20:30:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:30:20,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 20:30:20,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:30:20,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 20:30:20,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:30:20,712 INFO L87 Difference]: Start difference. First operand 3318 states and 7714 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:30:22,931 INFO L93 Difference]: Finished difference Result 5194 states and 11787 transitions. [2021-11-25 20:30:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 20:30:22,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:30:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:30:22,937 INFO L225 Difference]: With dead ends: 5194 [2021-11-25 20:30:22,937 INFO L226 Difference]: Without dead ends: 5174 [2021-11-25 20:30:22,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2021-11-25 20:30:22,938 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 346 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:30:22,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 25 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:30:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2021-11-25 20:30:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 3314. [2021-11-25 20:30:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 3304 states have (on average 2.330811138014528) internal successors, (7701), 3313 states have internal predecessors, (7701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 7701 transitions. [2021-11-25 20:30:23,006 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 7701 transitions. Word has length 21 [2021-11-25 20:30:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:30:23,006 INFO L470 AbstractCegarLoop]: Abstraction has 3314 states and 7701 transitions. [2021-11-25 20:30:23,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 7701 transitions. [2021-11-25 20:30:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:30:23,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:30:23,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:30:23,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-11-25 20:30:23,010 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:30:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:30:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1277758066, now seen corresponding path program 3 times [2021-11-25 20:30:23,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:30:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125634795] [2021-11-25 20:30:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:30:23,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:30:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:30:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:30:23,208 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:30:23,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125634795] [2021-11-25 20:30:23,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125634795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:30:23,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:30:23,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:30:23,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364605476] [2021-11-25 20:30:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:30:23,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:30:23,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:30:23,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:30:23,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:30:23,210 INFO L87 Difference]: Start difference. First operand 3314 states and 7701 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:30:25,499 INFO L93 Difference]: Finished difference Result 7146 states and 16164 transitions. [2021-11-25 20:30:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 20:30:25,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:30:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:30:25,508 INFO L225 Difference]: With dead ends: 7146 [2021-11-25 20:30:25,508 INFO L226 Difference]: Without dead ends: 7124 [2021-11-25 20:30:25,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2021-11-25 20:30:25,509 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 780 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:30:25,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [780 Valid, 101 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 20:30:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2021-11-25 20:30:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 3275. [2021-11-25 20:30:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3265 states have (on average 2.330168453292496) internal successors, (7608), 3274 states have internal predecessors, (7608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 7608 transitions. [2021-11-25 20:30:25,565 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 7608 transitions. Word has length 21 [2021-11-25 20:30:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:30:25,565 INFO L470 AbstractCegarLoop]: Abstraction has 3275 states and 7608 transitions. [2021-11-25 20:30:25,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 7608 transitions. [2021-11-25 20:30:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:30:25,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:30:25,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:30:25,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-11-25 20:30:25,569 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:30:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:30:25,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1556675290, now seen corresponding path program 4 times [2021-11-25 20:30:25,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:30:25,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717606488] [2021-11-25 20:30:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:30:25,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:30:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:30:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:30:25,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:30:25,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717606488] [2021-11-25 20:30:25,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717606488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:30:25,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:30:25,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:30:25,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592359420] [2021-11-25 20:30:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:30:25,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:30:25,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:30:25,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:30:25,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:30:25,761 INFO L87 Difference]: Start difference. First operand 3275 states and 7608 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:30:28,320 INFO L93 Difference]: Finished difference Result 9854 states and 22399 transitions. [2021-11-25 20:30:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 20:30:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:30:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:30:28,333 INFO L225 Difference]: With dead ends: 9854 [2021-11-25 20:30:28,333 INFO L226 Difference]: Without dead ends: 9818 [2021-11-25 20:30:28,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=874, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 20:30:28,333 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1151 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:30:28,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1151 Valid, 161 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 20:30:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9818 states. [2021-11-25 20:30:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9818 to 3225. [2021-11-25 20:30:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 3215 states have (on average 2.3303265940902023) internal successors, (7492), 3224 states have internal predecessors, (7492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 7492 transitions. [2021-11-25 20:30:28,403 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 7492 transitions. Word has length 21 [2021-11-25 20:30:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:30:28,403 INFO L470 AbstractCegarLoop]: Abstraction has 3225 states and 7492 transitions. [2021-11-25 20:30:28,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 7492 transitions. [2021-11-25 20:30:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:30:28,405 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:30:28,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:30:28,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-11-25 20:30:28,406 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:30:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:30:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2054747582, now seen corresponding path program 5 times [2021-11-25 20:30:28,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:30:28,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688146627] [2021-11-25 20:30:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:30:28,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:30:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:30:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:30:28,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:30:28,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688146627] [2021-11-25 20:30:28,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688146627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:30:28,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:30:28,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:30:28,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832748372] [2021-11-25 20:30:28,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:30:28,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:30:28,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:30:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:30:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:30:28,564 INFO L87 Difference]: Start difference. First operand 3225 states and 7492 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:30:31,504 INFO L93 Difference]: Finished difference Result 9323 states and 21134 transitions. [2021-11-25 20:30:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 20:30:31,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:30:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:30:31,516 INFO L225 Difference]: With dead ends: 9323 [2021-11-25 20:30:31,516 INFO L226 Difference]: Without dead ends: 9287 [2021-11-25 20:30:31,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 20:30:31,516 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 886 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:30:31,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 118 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 20:30:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9287 states. [2021-11-25 20:30:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9287 to 3218. [2021-11-25 20:30:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3208 states have (on average 2.3285536159600997) internal successors, (7470), 3217 states have internal predecessors, (7470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 7470 transitions. [2021-11-25 20:30:31,583 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 7470 transitions. Word has length 21 [2021-11-25 20:30:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:30:31,583 INFO L470 AbstractCegarLoop]: Abstraction has 3218 states and 7470 transitions. [2021-11-25 20:30:31,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 7470 transitions. [2021-11-25 20:30:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:30:31,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:30:31,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:30:31,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-11-25 20:30:31,585 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:30:31,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:30:31,585 INFO L85 PathProgramCache]: Analyzing trace with hash 903936930, now seen corresponding path program 3 times [2021-11-25 20:30:31,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:30:31,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379674485] [2021-11-25 20:30:31,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:30:31,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:30:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:30:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:30:35,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:30:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379674485] [2021-11-25 20:30:35,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379674485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:30:35,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:30:35,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 20:30:35,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578476554] [2021-11-25 20:30:35,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:30:35,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 20:30:35,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:30:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 20:30:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-11-25 20:30:35,831 INFO L87 Difference]: Start difference. First operand 3218 states and 7470 transitions. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:30:50,248 INFO L93 Difference]: Finished difference Result 5379 states and 12292 transitions. [2021-11-25 20:30:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-25 20:30:50,249 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:30:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:30:50,255 INFO L225 Difference]: With dead ends: 5379 [2021-11-25 20:30:50,255 INFO L226 Difference]: Without dead ends: 5379 [2021-11-25 20:30:50,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=706, Invalid=3200, Unknown=0, NotChecked=0, Total=3906 [2021-11-25 20:30:50,255 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 866 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 7582 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 7582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:30:50,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [866 Valid, 24 Invalid, 7661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 7582 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2021-11-25 20:30:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2021-11-25 20:30:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 3233. [2021-11-25 20:30:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 3223 states have (on average 2.3276450511945392) internal successors, (7502), 3232 states have internal predecessors, (7502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 7502 transitions. [2021-11-25 20:30:50,323 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 7502 transitions. Word has length 21 [2021-11-25 20:30:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:30:50,324 INFO L470 AbstractCegarLoop]: Abstraction has 3233 states and 7502 transitions. [2021-11-25 20:30:50,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:30:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 7502 transitions. [2021-11-25 20:30:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:30:50,325 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:30:50,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:30:50,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-11-25 20:30:50,325 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:30:50,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:30:50,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1580678102, now seen corresponding path program 4 times [2021-11-25 20:30:50,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:30:50,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368056750] [2021-11-25 20:30:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:30:50,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:30:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:30:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:30:52,577 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:30:52,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368056750] [2021-11-25 20:30:52,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368056750] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:30:52,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:30:52,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 20:30:52,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577103645] [2021-11-25 20:30:52,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:30:52,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 20:30:52,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:30:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 20:30:52,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-11-25 20:30:52,578 INFO L87 Difference]: Start difference. First operand 3233 states and 7502 transitions. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:03,737 INFO L93 Difference]: Finished difference Result 4948 states and 11385 transitions. [2021-11-25 20:31:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 20:31:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:31:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:03,742 INFO L225 Difference]: With dead ends: 4948 [2021-11-25 20:31:03,742 INFO L226 Difference]: Without dead ends: 4948 [2021-11-25 20:31:03,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2021-11-25 20:31:03,743 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 835 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 6743 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 6801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 6743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:03,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 24 Invalid, 6801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 6743 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2021-11-25 20:31:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4948 states. [2021-11-25 20:31:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4948 to 3218. [2021-11-25 20:31:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3208 states have (on average 2.3285536159600997) internal successors, (7470), 3217 states have internal predecessors, (7470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 7470 transitions. [2021-11-25 20:31:03,792 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 7470 transitions. Word has length 21 [2021-11-25 20:31:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:03,792 INFO L470 AbstractCegarLoop]: Abstraction has 3218 states and 7470 transitions. [2021-11-25 20:31:03,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 7470 transitions. [2021-11-25 20:31:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:31:03,794 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:03,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:31:03,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-11-25 20:31:03,794 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2013103944, now seen corresponding path program 5 times [2021-11-25 20:31:03,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:03,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171025626] [2021-11-25 20:31:03,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:03,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:06,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:06,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171025626] [2021-11-25 20:31:06,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171025626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:06,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:31:06,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:31:06,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211172385] [2021-11-25 20:31:06,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:06,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:31:06,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:06,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:31:06,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:31:06,657 INFO L87 Difference]: Start difference. First operand 3218 states and 7470 transitions. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:16,609 INFO L93 Difference]: Finished difference Result 5410 states and 12333 transitions. [2021-11-25 20:31:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-25 20:31:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:31:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:16,616 INFO L225 Difference]: With dead ends: 5410 [2021-11-25 20:31:16,616 INFO L226 Difference]: Without dead ends: 5410 [2021-11-25 20:31:16,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=542, Invalid=2008, Unknown=0, NotChecked=0, Total=2550 [2021-11-25 20:31:16,616 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 786 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 6260 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 6337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 6260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:16,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [786 Valid, 24 Invalid, 6337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 6260 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2021-11-25 20:31:16,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-11-25 20:31:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 3218. [2021-11-25 20:31:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3208 states have (on average 2.3285536159600997) internal successors, (7470), 3217 states have internal predecessors, (7470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 7470 transitions. [2021-11-25 20:31:16,662 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 7470 transitions. Word has length 21 [2021-11-25 20:31:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:16,662 INFO L470 AbstractCegarLoop]: Abstraction has 3218 states and 7470 transitions. [2021-11-25 20:31:16,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 7470 transitions. [2021-11-25 20:31:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:31:16,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:16,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:31:16,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-11-25 20:31:16,664 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:16,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:16,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1605122180, now seen corresponding path program 6 times [2021-11-25 20:31:16,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:16,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893901868] [2021-11-25 20:31:16,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:16,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:18,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:18,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893901868] [2021-11-25 20:31:18,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893901868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:18,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:31:18,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 20:31:18,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110332741] [2021-11-25 20:31:18,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:18,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:31:18,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:31:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-11-25 20:31:18,130 INFO L87 Difference]: Start difference. First operand 3218 states and 7470 transitions. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:26,318 INFO L93 Difference]: Finished difference Result 6058 states and 13799 transitions. [2021-11-25 20:31:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-25 20:31:26,318 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:31:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:26,325 INFO L225 Difference]: With dead ends: 6058 [2021-11-25 20:31:26,325 INFO L226 Difference]: Without dead ends: 6058 [2021-11-25 20:31:26,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=680, Invalid=2742, Unknown=0, NotChecked=0, Total=3422 [2021-11-25 20:31:26,325 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 1000 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 7141 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 7141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:26,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1000 Valid, 24 Invalid, 7207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 7141 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2021-11-25 20:31:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2021-11-25 20:31:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3044. [2021-11-25 20:31:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 3034 states have (on average 2.3216875411997364) internal successors, (7044), 3043 states have internal predecessors, (7044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 7044 transitions. [2021-11-25 20:31:26,371 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 7044 transitions. Word has length 21 [2021-11-25 20:31:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:26,372 INFO L470 AbstractCegarLoop]: Abstraction has 3044 states and 7044 transitions. [2021-11-25 20:31:26,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 7044 transitions. [2021-11-25 20:31:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:31:26,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:26,373 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:31:26,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-11-25 20:31:26,373 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1698684775, now seen corresponding path program 1 times [2021-11-25 20:31:26,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:26,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791832857] [2021-11-25 20:31:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:26,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:26,600 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:26,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791832857] [2021-11-25 20:31:26,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791832857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:26,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:31:26,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 20:31:26,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134669289] [2021-11-25 20:31:26,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:26,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 20:31:26,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:26,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 20:31:26,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:31:26,601 INFO L87 Difference]: Start difference. First operand 3044 states and 7044 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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) [2021-11-25 20:31:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:28,162 INFO L93 Difference]: Finished difference Result 3800 states and 8678 transitions. [2021-11-25 20:31:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:31:28,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 [2021-11-25 20:31:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:28,172 INFO L225 Difference]: With dead ends: 3800 [2021-11-25 20:31:28,172 INFO L226 Difference]: Without dead ends: 3800 [2021-11-25 20:31:28,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:31:28,172 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 233 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:28,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 17 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 20:31:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2021-11-25 20:31:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3088. [2021-11-25 20:31:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 3078 states have (on average 2.3242365172189734) internal successors, (7154), 3087 states have internal predecessors, (7154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 7154 transitions. [2021-11-25 20:31:28,210 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 7154 transitions. Word has length 23 [2021-11-25 20:31:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:28,210 INFO L470 AbstractCegarLoop]: Abstraction has 3088 states and 7154 transitions. [2021-11-25 20:31:28,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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) [2021-11-25 20:31:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 7154 transitions. [2021-11-25 20:31:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:31:28,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:28,212 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:31:28,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-11-25 20:31:28,212 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1379100905, now seen corresponding path program 2 times [2021-11-25 20:31:28,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:28,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680248551] [2021-11-25 20:31:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:28,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:28,660 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:28,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680248551] [2021-11-25 20:31:28,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680248551] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:28,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:31:28,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:31:28,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765765493] [2021-11-25 20:31:28,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:28,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:31:28,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:28,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:31:28,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:31:28,662 INFO L87 Difference]: Start difference. First operand 3088 states and 7154 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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) [2021-11-25 20:31:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:30,498 INFO L93 Difference]: Finished difference Result 3890 states and 8864 transitions. [2021-11-25 20:31:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:31:30,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 [2021-11-25 20:31:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:30,503 INFO L225 Difference]: With dead ends: 3890 [2021-11-25 20:31:30,503 INFO L226 Difference]: Without dead ends: 3890 [2021-11-25 20:31:30,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-11-25 20:31:30,504 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 324 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:30,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 34 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 20:31:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2021-11-25 20:31:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3138. [2021-11-25 20:31:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 3128 states have (on average 2.3209718670076724) internal successors, (7260), 3137 states have internal predecessors, (7260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 7260 transitions. [2021-11-25 20:31:30,563 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 7260 transitions. Word has length 23 [2021-11-25 20:31:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:30,563 INFO L470 AbstractCegarLoop]: Abstraction has 3138 states and 7260 transitions. [2021-11-25 20:31:30,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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) [2021-11-25 20:31:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 7260 transitions. [2021-11-25 20:31:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:31:30,564 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:30,565 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:31:30,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-11-25 20:31:30,565 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1347341935, now seen corresponding path program 3 times [2021-11-25 20:31:30,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:30,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455129595] [2021-11-25 20:31:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:30,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:31,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:31,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455129595] [2021-11-25 20:31:31,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455129595] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:31,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:31:31,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 20:31:31,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275007316] [2021-11-25 20:31:31,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:31,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:31:31,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:31,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:31:31,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:31:31,049 INFO L87 Difference]: Start difference. First operand 3138 states and 7260 transitions. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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) [2021-11-25 20:31:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:35,859 INFO L93 Difference]: Finished difference Result 5539 states and 12655 transitions. [2021-11-25 20:31:35,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 20:31:35,859 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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 [2021-11-25 20:31:35,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:35,866 INFO L225 Difference]: With dead ends: 5539 [2021-11-25 20:31:35,866 INFO L226 Difference]: Without dead ends: 5539 [2021-11-25 20:31:35,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 20:31:35,866 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1447 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:35,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1447 Valid, 34 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 20:31:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5539 states. [2021-11-25 20:31:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5539 to 3433. [2021-11-25 20:31:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3423 states have (on average 2.3330411919368976) internal successors, (7986), 3432 states have internal predecessors, (7986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 7986 transitions. [2021-11-25 20:31:35,916 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 7986 transitions. Word has length 23 [2021-11-25 20:31:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:35,916 INFO L470 AbstractCegarLoop]: Abstraction has 3433 states and 7986 transitions. [2021-11-25 20:31:35,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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) [2021-11-25 20:31:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 7986 transitions. [2021-11-25 20:31:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:31:35,918 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:35,918 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:31:35,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-11-25 20:31:35,918 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1532366899, now seen corresponding path program 1 times [2021-11-25 20:31:35,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:35,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592500113] [2021-11-25 20:31:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:35,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:36,627 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592500113] [2021-11-25 20:31:36,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592500113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:36,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:31:36,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 20:31:36,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498634375] [2021-11-25 20:31:36,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:36,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:31:36,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:31:36,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:31:36,628 INFO L87 Difference]: Start difference. First operand 3433 states and 7986 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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) [2021-11-25 20:31:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:40,125 INFO L93 Difference]: Finished difference Result 4224 states and 9683 transitions. [2021-11-25 20:31:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 20:31:40,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 [2021-11-25 20:31:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:40,151 INFO L225 Difference]: With dead ends: 4224 [2021-11-25 20:31:40,151 INFO L226 Difference]: Without dead ends: 4194 [2021-11-25 20:31:40,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2021-11-25 20:31:40,151 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 342 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 3186 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:40,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 35 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3186 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-11-25 20:31:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2021-11-25 20:31:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 3460. [2021-11-25 20:31:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 3450 states have (on average 2.3330434782608696) internal successors, (8049), 3459 states have internal predecessors, (8049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 8049 transitions. [2021-11-25 20:31:40,190 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 8049 transitions. Word has length 23 [2021-11-25 20:31:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:40,191 INFO L470 AbstractCegarLoop]: Abstraction has 3460 states and 8049 transitions. [2021-11-25 20:31:40,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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) [2021-11-25 20:31:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 8049 transitions. [2021-11-25 20:31:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:31:40,193 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:40,193 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:31:40,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-11-25 20:31:40,193 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 772981485, now seen corresponding path program 2 times [2021-11-25 20:31:40,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:40,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316415584] [2021-11-25 20:31:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:40,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:41,980 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:41,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316415584] [2021-11-25 20:31:41,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316415584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:41,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:31:41,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 20:31:41,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855125089] [2021-11-25 20:31:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:41,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:31:41,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:41,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:31:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:31:41,982 INFO L87 Difference]: Start difference. First operand 3460 states and 8049 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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) [2021-11-25 20:31:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:46,502 INFO L93 Difference]: Finished difference Result 4804 states and 11012 transitions. [2021-11-25 20:31:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 20:31:46,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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 [2021-11-25 20:31:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:46,507 INFO L225 Difference]: With dead ends: 4804 [2021-11-25 20:31:46,508 INFO L226 Difference]: Without dead ends: 4774 [2021-11-25 20:31:46,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2021-11-25 20:31:46,508 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 437 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 3760 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:46,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 35 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3760 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-11-25 20:31:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4774 states. [2021-11-25 20:31:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4774 to 3522. [2021-11-25 20:31:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 3512 states have (on average 2.3405466970387243) internal successors, (8220), 3521 states have internal predecessors, (8220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 8220 transitions. [2021-11-25 20:31:46,553 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 8220 transitions. Word has length 23 [2021-11-25 20:31:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:46,553 INFO L470 AbstractCegarLoop]: Abstraction has 3522 states and 8220 transitions. [2021-11-25 20:31:46,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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) [2021-11-25 20:31:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 8220 transitions. [2021-11-25 20:31:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:31:46,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:46,555 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:31:46,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-11-25 20:31:46,556 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1145007093, now seen corresponding path program 1 times [2021-11-25 20:31:46,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:46,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924649897] [2021-11-25 20:31:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:46,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:47,230 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:47,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924649897] [2021-11-25 20:31:47,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924649897] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:31:47,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023930991] [2021-11-25 20:31:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:47,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:31:47,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:31:47,231 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:31:47,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 20:31:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:47,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 20:31:47,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:31:47,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-11-25 20:31:47,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2021-11-25 20:31:47,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2021-11-25 20:31:47,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:31:47,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:31:47,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:47,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2021-11-25 20:31:48,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:48,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:48,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-11-25 20:31:48,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:48,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:31:48,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2021-11-25 20:31:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:48,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-11-25 20:31:48,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:48,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-11-25 20:31:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:48,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:31:48,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023930991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:48,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:31:48,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 24 [2021-11-25 20:31:48,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362010985] [2021-11-25 20:31:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:48,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:31:48,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:31:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-11-25 20:31:48,486 INFO L87 Difference]: Start difference. First operand 3522 states and 8220 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 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) [2021-11-25 20:31:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:50,403 INFO L93 Difference]: Finished difference Result 4503 states and 10351 transitions. [2021-11-25 20:31:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 20:31:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 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 [2021-11-25 20:31:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:50,409 INFO L225 Difference]: With dead ends: 4503 [2021-11-25 20:31:50,410 INFO L226 Difference]: Without dead ends: 4503 [2021-11-25 20:31:50,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2021-11-25 20:31:50,410 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 308 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:50,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 32 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 20:31:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2021-11-25 20:31:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 3656. [2021-11-25 20:31:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 3646 states have (on average 2.335436094349973) internal successors, (8515), 3655 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 8515 transitions. [2021-11-25 20:31:50,462 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 8515 transitions. Word has length 23 [2021-11-25 20:31:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:50,462 INFO L470 AbstractCegarLoop]: Abstraction has 3656 states and 8515 transitions. [2021-11-25 20:31:50,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 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) [2021-11-25 20:31:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 8515 transitions. [2021-11-25 20:31:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:31:50,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:50,464 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:31:50,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 20:31:50,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2021-11-25 20:31:50,667 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash 367111449, now seen corresponding path program 3 times [2021-11-25 20:31:50,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:50,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968604540] [2021-11-25 20:31:50,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:50,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:52,495 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:52,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968604540] [2021-11-25 20:31:52,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968604540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:31:52,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:31:52,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 20:31:52,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386321741] [2021-11-25 20:31:52,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:31:52,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:31:52,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:31:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:31:52,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:31:52,497 INFO L87 Difference]: Start difference. First operand 3656 states and 8515 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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) [2021-11-25 20:31:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:31:57,282 INFO L93 Difference]: Finished difference Result 5356 states and 12267 transitions. [2021-11-25 20:31:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 20:31:57,282 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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 [2021-11-25 20:31:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:31:57,289 INFO L225 Difference]: With dead ends: 5356 [2021-11-25 20:31:57,289 INFO L226 Difference]: Without dead ends: 5325 [2021-11-25 20:31:57,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2021-11-25 20:31:57,289 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 429 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 3790 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:31:57,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 34 Invalid, 3824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3790 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-25 20:31:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2021-11-25 20:31:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 3662. [2021-11-25 20:31:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 3652 states have (on average 2.3373493975903616) internal successors, (8536), 3661 states have internal predecessors, (8536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:31:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 8536 transitions. [2021-11-25 20:31:57,378 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 8536 transitions. Word has length 23 [2021-11-25 20:31:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:31:57,378 INFO L470 AbstractCegarLoop]: Abstraction has 3662 states and 8536 transitions. [2021-11-25 20:31:57,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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) [2021-11-25 20:31:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 8536 transitions. [2021-11-25 20:31:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:31:57,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:31:57,382 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:31:57,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-11-25 20:31:57,382 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:31:57,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:31:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash 645841593, now seen corresponding path program 2 times [2021-11-25 20:31:57,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:31:57,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523376195] [2021-11-25 20:31:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:31:57,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:31:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:31:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:31:58,822 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:31:58,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523376195] [2021-11-25 20:31:58,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523376195] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:31:58,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447353243] [2021-11-25 20:31:58,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:31:58,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:31:58,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:31:58,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:31:58,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 20:31:59,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:31:59,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:31:59,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-25 20:31:59,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:31:59,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-11-25 20:31:59,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-11-25 20:31:59,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:31:59,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2021-11-25 20:31:59,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:31:59,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:32:00,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:00,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:32:00,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2021-11-25 20:32:00,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:00,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:32:00,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-11-25 20:32:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:00,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:00,330 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:00,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2021-11-25 20:32:00,342 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:00,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 [2021-11-25 20:32:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:00,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447353243] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:00,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2021881664] [2021-11-25 20:32:00,901 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:00,901 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:00,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 35 [2021-11-25 20:32:00,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71895615] [2021-11-25 20:32:00,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:00,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 20:32:00,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:00,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 20:32:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 20:32:00,903 INFO L87 Difference]: Start difference. First operand 3662 states and 8536 transitions. Second operand has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:13,523 INFO L93 Difference]: Finished difference Result 6567 states and 15012 transitions. [2021-11-25 20:32:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-25 20:32:13,524 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 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 [2021-11-25 20:32:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:13,532 INFO L225 Difference]: With dead ends: 6567 [2021-11-25 20:32:13,532 INFO L226 Difference]: Without dead ends: 6567 [2021-11-25 20:32:13,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1212, Invalid=5430, Unknown=0, NotChecked=0, Total=6642 [2021-11-25 20:32:13,532 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1957 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 8359 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 8624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 8359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:13,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1957 Valid, 64 Invalid, 8624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 8359 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2021-11-25 20:32:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2021-11-25 20:32:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 3880. [2021-11-25 20:32:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 3870 states have (on average 2.3560723514211888) internal successors, (9118), 3879 states have internal predecessors, (9118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 9118 transitions. [2021-11-25 20:32:13,597 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 9118 transitions. Word has length 23 [2021-11-25 20:32:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:13,597 INFO L470 AbstractCegarLoop]: Abstraction has 3880 states and 9118 transitions. [2021-11-25 20:32:13,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 9118 transitions. [2021-11-25 20:32:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:32:13,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:13,599 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:13,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-11-25 20:32:13,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2021-11-25 20:32:13,802 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:32:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:13,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1721790275, now seen corresponding path program 3 times [2021-11-25 20:32:13,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:13,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607656564] [2021-11-25 20:32:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:13,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:15,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:15,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607656564] [2021-11-25 20:32:15,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607656564] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:15,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247520383] [2021-11-25 20:32:15,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:32:15,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:15,594 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:15,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 20:32:16,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:32:16,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:32:16,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-25 20:32:16,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:16,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,229 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 20:32:16,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2021-11-25 20:32:16,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,250 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 20:32:16,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2021-11-25 20:32:16,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 94 [2021-11-25 20:32:16,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:32:16,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:32:16,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:32:16,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-11-25 20:32:16,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:16,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:32:16,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2021-11-25 20:32:17,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:17,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 20:32:17,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:17,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 20:32:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:17,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:17,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204|) (and (forall ((v_ArrVal_9726 (Array Int Int))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9726) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (forall ((v_ArrVal_9725 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9725) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))))) is different from false [2021-11-25 20:32:19,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204|) (and (forall ((v_ArrVal_9726 (Array Int Int))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9726) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (forall ((v_ArrVal_9725 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9725) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))))) is different from false [2021-11-25 20:32:19,375 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:19,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 53 [2021-11-25 20:32:19,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:19,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 80 [2021-11-25 20:32:19,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2021-11-25 20:32:19,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 33 [2021-11-25 20:32:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-25 20:32:20,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247520383] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:20,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1313878414] [2021-11-25 20:32:20,121 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:20,122 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:20,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 38 [2021-11-25 20:32:20,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31498918] [2021-11-25 20:32:20,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:20,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 20:32:20,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 20:32:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1198, Unknown=2, NotChecked=142, Total=1482 [2021-11-25 20:32:20,123 INFO L87 Difference]: Start difference. First operand 3880 states and 9118 transitions. Second operand has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 38 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) [2021-11-25 20:32:29,774 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_empty_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= (select .cse0 .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select .cse2 .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (let ((.cse3 (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (or (and (not (= (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) .cse3) (let ((.cse4 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (= (select .cse2 .cse4) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= (select .cse0 .cse4) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|))) (let ((.cse5 (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| .cse5) .cse3 (not (= (select .cse2 .cse5) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_empty_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (< |c_#StackHeapBarrier| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204|) (and (forall ((v_ArrVal_9726 (Array Int Int))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9726) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (forall ((v_ArrVal_9725 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9725) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))))) (< |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 4) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 4) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (< |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) is different from false [2021-11-25 20:32:32,676 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_empty_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204|) (and (forall ((v_ArrVal_9726 (Array Int Int))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9726) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (forall ((v_ArrVal_9725 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9725) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))))) (< |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 4) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 4) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|)) is different from false [2021-11-25 20:32:36,781 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| 1) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 4) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 4) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204|) (and (forall ((v_ArrVal_9726 (Array Int Int))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9726) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (forall ((v_ArrVal_9725 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_204| v_ArrVal_9725) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))))) (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_empty_~self#1.base|)) is different from false [2021-11-25 20:32:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:40,518 INFO L93 Difference]: Finished difference Result 6542 states and 15098 transitions. [2021-11-25 20:32:40,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-11-25 20:32:40,518 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 38 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 20:32:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:40,526 INFO L225 Difference]: With dead ends: 6542 [2021-11-25 20:32:40,526 INFO L226 Difference]: Without dead ends: 6542 [2021-11-25 20:32:40,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1909 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1584, Invalid=7361, Unknown=5, NotChecked=950, Total=9900 [2021-11-25 20:32:40,527 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 1333 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 8269 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 10150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 8269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1615 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:40,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1333 Valid, 46 Invalid, 10150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 8269 Invalid, 0 Unknown, 1615 Unchecked, 6.8s Time] [2021-11-25 20:32:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6542 states. [2021-11-25 20:32:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6542 to 3888. [2021-11-25 20:32:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 3878 states have (on average 2.357658586900464) internal successors, (9143), 3887 states have internal predecessors, (9143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 9143 transitions. [2021-11-25 20:32:40,587 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 9143 transitions. Word has length 23 [2021-11-25 20:32:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:40,588 INFO L470 AbstractCegarLoop]: Abstraction has 3888 states and 9143 transitions. [2021-11-25 20:32:40,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 38 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) [2021-11-25 20:32:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 9143 transitions. [2021-11-25 20:32:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:32:40,590 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:40,590 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:32:40,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:40,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2021-11-25 20:32:40,790 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:32:40,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1578054567, now seen corresponding path program 4 times [2021-11-25 20:32:40,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:40,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134368966] [2021-11-25 20:32:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:40,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:41,662 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:41,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134368966] [2021-11-25 20:32:41,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134368966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:41,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:41,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-25 20:32:41,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887166970] [2021-11-25 20:32:41,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:41,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 20:32:41,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:41,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 20:32:41,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2021-11-25 20:32:41,663 INFO L87 Difference]: Start difference. First operand 3888 states and 9143 transitions. Second operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 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) [2021-11-25 20:32:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:52,759 INFO L93 Difference]: Finished difference Result 7746 states and 18170 transitions. [2021-11-25 20:32:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 20:32:52,759 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 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 [2021-11-25 20:32:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:52,769 INFO L225 Difference]: With dead ends: 7746 [2021-11-25 20:32:52,769 INFO L226 Difference]: Without dead ends: 7746 [2021-11-25 20:32:52,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=450, Invalid=2742, Unknown=0, NotChecked=0, Total=3192 [2021-11-25 20:32:52,769 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 959 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 8650 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 8748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 8650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:52,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 33 Invalid, 8748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 8650 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2021-11-25 20:32:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2021-11-25 20:32:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 4215. [2021-11-25 20:32:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4215 states, 4205 states have (on average 2.370035671819263) internal successors, (9966), 4214 states have internal predecessors, (9966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4215 states to 4215 states and 9966 transitions. [2021-11-25 20:32:52,881 INFO L78 Accepts]: Start accepts. Automaton has 4215 states and 9966 transitions. Word has length 23 [2021-11-25 20:32:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:52,881 INFO L470 AbstractCegarLoop]: Abstraction has 4215 states and 9966 transitions. [2021-11-25 20:32:52,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 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) [2021-11-25 20:32:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4215 states and 9966 transitions. [2021-11-25 20:32:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:32:52,884 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:52,884 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:52,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-11-25 20:32:52,884 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 20:32:52,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1546354607, now seen corresponding path program 4 times [2021-11-25 20:32:52,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:52,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857555604] [2021-11-25 20:32:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:52,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:53,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:53,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857555604] [2021-11-25 20:32:53,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857555604] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:53,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724296197] [2021-11-25 20:32:53,531 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:32:53,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:53,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:53,531 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:53,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 20:32:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:54,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 114 conjunts are in the unsatisfiable core [2021-11-25 20:32:54,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:54,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 20:32:54,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 20:32:54,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2021-11-25 20:32:54,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 17 [2021-11-25 20:32:54,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2021-11-25 20:32:54,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:32:54,955 INFO L354 Elim1Store]: treesize reduction 90, result has 56.1 percent of original size [2021-11-25 20:32:54,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 89 treesize of output 152 [2021-11-25 20:32:54,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:54,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:32:55,043 INFO L354 Elim1Store]: treesize reduction 54, result has 55.7 percent of original size [2021-11-25 20:32:55,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 84 [2021-11-25 20:33:02,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:33:02,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:33:02,427 INFO L354 Elim1Store]: treesize reduction 15, result has 34.8 percent of original size [2021-11-25 20:33:02,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 205 [2021-11-25 20:33:02,911 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-11-25 20:33:02,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 51 [2021-11-25 20:33:08,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:33:08,925 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-11-25 20:33:08,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 107 [2021-11-25 20:33:08,931 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-11-25 20:33:08,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [712811047] [2021-11-25 20:33:08,932 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:33:08,933 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:33:08,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-25 20:33:08,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818640389] [2021-11-25 20:33:08,934 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:33:08,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 20:33:08,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:08,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 20:33:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=809, Unknown=2, NotChecked=0, Total=930 [2021-11-25 20:33:08,935 INFO L87 Difference]: Start difference. First operand 4215 states and 9966 transitions. Second operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) [2021-11-25 20:33:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 20:33:08,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=119, Invalid=809, Unknown=2, NotChecked=0, Total=930 [2021-11-25 20:33:08,936 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:08,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:33:08,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 20:33:09,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2021-11-25 20:33:09,137 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@16da188 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:33:09,138 INFO L158 Benchmark]: Toolchain (without parser) took 646471.66ms. Allocated memory was 104.9MB in the beginning and 597.7MB in the end (delta: 492.8MB). Free memory was 70.2MB in the beginning and 329.2MB in the end (delta: -259.0MB). Peak memory consumption was 234.8MB. Max. memory is 16.1GB. [2021-11-25 20:33:09,138 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 20:33:09,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 872.98ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 69.9MB in the beginning and 78.8MB in the end (delta: -8.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-25 20:33:09,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.30ms. Allocated memory is still 127.9MB. Free memory was 78.8MB in the beginning and 75.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 20:33:09,139 INFO L158 Benchmark]: Boogie Preprocessor took 110.46ms. Allocated memory is still 127.9MB. Free memory was 75.2MB in the beginning and 71.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 20:33:09,139 INFO L158 Benchmark]: RCFGBuilder took 946.25ms. Allocated memory is still 127.9MB. Free memory was 71.6MB in the beginning and 86.4MB in the end (delta: -14.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2021-11-25 20:33:09,139 INFO L158 Benchmark]: TraceAbstraction took 644436.46ms. Allocated memory was 127.9MB in the beginning and 597.7MB in the end (delta: 469.8MB). Free memory was 85.9MB in the beginning and 329.2MB in the end (delta: -243.3MB). Peak memory consumption was 227.9MB. Max. memory is 16.1GB. [2021-11-25 20:33:09,139 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.23ms. Allocated memory is still 104.9MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 872.98ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 69.9MB in the beginning and 78.8MB in the end (delta: -8.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.30ms. Allocated memory is still 127.9MB. Free memory was 78.8MB in the beginning and 75.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.46ms. Allocated memory is still 127.9MB. Free memory was 75.2MB in the beginning and 71.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 946.25ms. Allocated memory is still 127.9MB. Free memory was 71.6MB in the beginning and 86.4MB in the end (delta: -14.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * TraceAbstraction took 644436.46ms. Allocated memory was 127.9MB in the beginning and 597.7MB in the end (delta: 469.8MB). Free memory was 85.9MB in the beginning and 329.2MB in the end (delta: -243.3MB). Peak memory consumption was 227.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.3s, 478 PlacesBefore, 106 PlacesAfterwards, 507 TransitionsBefore, 123 TransitionsAfterwards, 36864 CoEnabledTransitionPairs, 17 FixpointIterations, 154 TrivialSequentialCompositions, 271 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 75 ConcurrentYvCompositions, 12 ChoiceCompositions, 546 TotalNumberOfCompositions, 142414 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41529, positive: 38682, positive conditional: 0, positive unconditional: 38682, negative: 2847, negative conditional: 0, negative unconditional: 2847, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24548, positive: 24175, positive conditional: 0, positive unconditional: 24175, negative: 373, negative conditional: 0, negative unconditional: 373, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24548, positive: 23779, positive conditional: 0, positive unconditional: 23779, negative: 769, negative conditional: 0, negative unconditional: 769, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 769, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 367, negative conditional: 0, negative unconditional: 367, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10611, positive: 251, positive conditional: 0, positive unconditional: 251, negative: 737, negative conditional: 0, negative unconditional: 737, unknown: 9622, unknown conditional: 0, unknown unconditional: 9622] ], Cache Queries: [ total: 41529, positive: 14507, positive conditional: 0, positive unconditional: 14507, negative: 2474, negative conditional: 0, negative unconditional: 2474, unknown: 24548, unknown conditional: 0, unknown unconditional: 24548] , Statistics on independence cache: Total cache size (in pairs): 1032, Positive cache size: 879, Positive conditional cache size: 0, Positive unconditional cache size: 879, Negative cache size: 153, Negative conditional cache size: 0, Negative unconditional cache size: 153 - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@16da188 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@16da188: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-25 20:33:09,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7 --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 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:33:11,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:33:11,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:33:11,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:33:11,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:33:11,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:33:11,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:33:11,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:33:11,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:33:11,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:33:11,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:33:11,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:33:11,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:33:11,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:33:11,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:33:11,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:33:11,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:33:11,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:33:11,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:33:11,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:33:11,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:33:11,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:33:11,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:33:11,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:33:11,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:33:11,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:33:11,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:33:11,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:33:11,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:33:11,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:33:11,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:33:11,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:33:11,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:33:11,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:33:11,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:33:11,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:33:11,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:33:11,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:33:11,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:33:11,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:33:11,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:33:11,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-25 20:33:11,705 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:33:11,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:33:11,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:33:11,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:33:11,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:33:11,708 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:33:11,708 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:33:11,708 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:33:11,708 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:33:11,708 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:33:11,709 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:33:11,710 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:33:11,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:33:11,711 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:33:11,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:33:11,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:33:11,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:33:11,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:33:11,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:33:11,713 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 20:33:11,713 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-25 20:33:11,713 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-25 20:33:11,713 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:33:11,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:33:11,714 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:33:11,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:33:11,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:33:11,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-25 20:33:11,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:33:11,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:33:11,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:33:11,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:33:11,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:33:11,716 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-25 20:33:11,717 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-25 20:33:11,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:33:11,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:33:11,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:33:11,718 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7 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 -> 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e [2021-11-25 20:33:12,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:33:12,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:33:12,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:33:12,140 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:33:12,141 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:33:12,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2021-11-25 20:33:12,216 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data/09f9ed2a5/337d9fc312a4404baa0bba33846b0010/FLAG69078b619 [2021-11-25 20:33:12,906 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:33:12,907 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2021-11-25 20:33:12,929 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data/09f9ed2a5/337d9fc312a4404baa0bba33846b0010/FLAG69078b619 [2021-11-25 20:33:13,129 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/data/09f9ed2a5/337d9fc312a4404baa0bba33846b0010 [2021-11-25 20:33:13,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:33:13,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:33:13,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:33:13,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:33:13,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:33:13,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:33:13" (1/1) ... [2021-11-25 20:33:13,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58abe96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:13, skipping insertion in model container [2021-11-25 20:33:13,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:33:13" (1/1) ... [2021-11-25 20:33:13,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:33:13,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:33:13,390 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 20:33:13,835 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2021-11-25 20:33:13,843 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2021-11-25 20:33:13,871 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2021-11-25 20:33:13,875 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2021-11-25 20:33:13,890 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2021-11-25 20:33:13,891 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2021-11-25 20:33:13,908 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2021-11-25 20:33:13,909 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2021-11-25 20:33:13,910 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2021-11-25 20:33:13,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:33:13,926 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:33:13,947 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 20:33:13,986 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2021-11-25 20:33:13,995 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2021-11-25 20:33:14,004 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2021-11-25 20:33:14,006 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2021-11-25 20:33:14,019 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2021-11-25 20:33:14,022 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2021-11-25 20:33:14,032 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2021-11-25 20:33:14,033 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2021-11-25 20:33:14,034 WARN L230 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_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2021-11-25 20:33:14,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:33:14,139 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:33:14,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14 WrapperNode [2021-11-25 20:33:14,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:33:14,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:33:14,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:33:14,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:33:14,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,256 INFO L137 Inliner]: procedures = 281, calls = 103, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 417 [2021-11-25 20:33:14,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:33:14,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:33:14,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:33:14,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:33:14,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:33:14,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:33:14,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:33:14,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:33:14,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (1/1) ... [2021-11-25 20:33:14,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:33:14,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:33:14,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:33:14,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd9eab09-f8c2-4a98-a52b-45a6ce7f3ac6/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:33:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-25 20:33:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2021-11-25 20:33:14,472 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2021-11-25 20:33:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:33:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 20:33:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-25 20:33:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:33:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-25 20:33:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 20:33:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:33:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 20:33:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:33:14,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:33:14,476 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:33:14,722 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:33:14,724 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:33:15,523 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:33:15,540 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:33:15,541 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-25 20:33:15,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:33:15 BoogieIcfgContainer [2021-11-25 20:33:15,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:33:15,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:33:15,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:33:15,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:33:15,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:33:13" (1/3) ... [2021-11-25 20:33:15,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c80dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:33:15, skipping insertion in model container [2021-11-25 20:33:15,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:14" (2/3) ... [2021-11-25 20:33:15,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c80dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:33:15, skipping insertion in model container [2021-11-25 20:33:15,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:33:15" (3/3) ... [2021-11-25 20:33:15,551 INFO L111 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2021-11-25 20:33:15,557 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:33:15,557 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:33:15,557 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-25 20:33:15,557 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:33:15,640 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,640 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,645 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,646 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,646 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,646 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,646 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,647 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,647 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,648 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,648 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,649 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,649 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,649 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,649 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,649 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,666 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,666 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,666 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,667 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,667 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,667 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,667 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,668 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,668 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,668 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,669 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,669 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,669 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,669 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,669 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,670 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,670 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,670 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,670 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,671 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,671 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,671 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,671 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,672 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,672 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,672 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,672 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,675 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,675 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,675 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,675 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,676 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,676 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,676 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,676 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,676 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,677 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,677 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,677 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,678 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,685 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,686 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,689 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,690 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,690 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,690 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,690 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,690 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,690 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,691 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,691 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,691 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,691 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,692 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,692 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,692 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,692 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,692 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,692 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,693 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,693 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,693 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,693 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,693 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,693 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,694 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,694 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,694 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,694 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,694 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,694 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,695 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,695 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,695 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,695 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,695 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,695 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,696 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,696 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,696 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,696 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,696 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,697 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,697 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,697 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,697 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,697 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,698 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,698 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,698 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,698 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,698 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,698 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,699 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,699 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,699 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,699 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,699 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,700 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,700 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,700 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,700 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,700 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,700 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,701 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,701 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,701 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,701 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,701 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,702 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,702 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,702 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,702 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,702 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,703 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,703 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,703 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,703 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,703 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,703 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,704 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,704 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,704 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,704 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,704 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,705 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,705 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,705 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,705 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,712 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,713 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,713 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,713 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,713 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,714 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,714 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,714 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,715 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,715 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,715 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,716 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,716 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,716 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,716 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,716 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,717 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,717 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,717 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,717 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,718 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,718 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,718 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,719 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,719 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,720 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,720 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,720 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,721 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,721 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,721 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,722 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,722 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,722 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,722 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,723 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,723 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,723 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,723 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,724 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,724 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,725 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,725 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,730 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,730 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,730 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,730 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,731 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,732 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,732 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,732 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,733 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,733 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,733 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,734 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,734 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,734 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,734 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,735 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,735 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,735 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,735 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,735 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,736 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,736 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,736 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,736 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,736 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,737 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,737 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,737 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,737 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,737 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,738 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,738 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,738 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,738 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,739 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,739 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,739 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,739 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,740 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,740 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,740 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,740 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,740 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,741 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,741 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,741 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,741 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,741 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,742 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,742 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,742 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,742 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,743 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,743 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,743 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,743 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,743 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,744 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,744 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,744 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,744 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,744 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,745 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,745 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,745 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,745 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,746 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,746 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,746 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,746 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,747 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,747 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,747 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,747 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,747 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,748 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,748 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,748 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,748 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,749 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,749 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,749 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,749 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,749 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,750 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,750 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,750 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,750 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,750 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,751 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,751 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,751 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,751 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,751 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,752 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,752 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,752 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,752 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,753 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,753 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,753 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,753 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,755 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,755 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,755 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,755 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,756 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,756 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,756 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,757 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,757 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,759 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,759 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,759 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,760 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,760 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,760 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,760 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,760 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,760 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,761 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,761 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,761 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,761 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,761 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,762 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,762 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,766 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,767 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,768 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,769 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,772 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,773 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,774 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,775 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,776 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,776 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,777 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,778 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,779 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,780 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,781 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,782 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,783 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,788 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,789 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,790 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,791 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,792 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,793 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,794 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,795 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,796 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:15,802 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-11-25 20:33:15,864 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:33:15,871 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:33:15,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-11-25 20:33:15,897 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:33:15,910 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 479 places, 508 transitions, 1024 flow [2021-11-25 20:33:15,913 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 479 places, 508 transitions, 1024 flow [2021-11-25 20:33:15,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 479 places, 508 transitions, 1024 flow [2021-11-25 20:33:16,106 INFO L129 PetriNetUnfolder]: 33/507 cut-off events. [2021-11-25 20:33:16,107 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-25 20:33:16,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 507 events. 33/507 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1163 event pairs, 0 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 352. Up to 3 conditions per place. [2021-11-25 20:33:16,156 INFO L116 LiptonReduction]: Number of co-enabled transitions 36864