./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/divinefifo_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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/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 43c4691e367ff0d8a9949fa90f15eddbc091ab75ed1546de74dafe83c2376639 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:50:49,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:50:49,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:50:49,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:50:49,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:50:49,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:50:49,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:50:49,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:50:49,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:50:49,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:50:49,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:50:49,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:50:49,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:50:49,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:50:49,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:50:49,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:50:49,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:50:49,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:50:49,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:50:49,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:50:49,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:50:49,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:50:49,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:50:49,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:50:49,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:50:49,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:50:49,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:50:49,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:50:49,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:50:49,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:50:49,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:50:49,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:50:49,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:50:49,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:50:49,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:50:49,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:50:49,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:50:49,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:50:49,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:50:49,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:50:49,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:50:49,682 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 18:50:49,709 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:50:49,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:50:49,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:50:49,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:50:49,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:50:49,711 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:50:49,711 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:50:49,712 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:50:49,712 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:50:49,712 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:50:49,712 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:50:49,712 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:50:49,713 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:50:49,713 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:50:49,713 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:50:49,713 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:50:49,714 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:50:49,714 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:50:49,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:50:49,715 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:50:49,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:50:49,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:50:49,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:50:49,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:50:49,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:50:49,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:50:49,717 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:50:49,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:50:49,717 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:50:49,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:50:49,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:50:49,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:50:49,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:50:49,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:50:49,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:50:49,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:50:49,719 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:50:49,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:50:49,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:50:49,720 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:50:49,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:50:49,720 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/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 -> 43c4691e367ff0d8a9949fa90f15eddbc091ab75ed1546de74dafe83c2376639 [2021-11-25 18:50:49,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:50:49,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:50:49,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:50:49,999 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:50:49,999 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:50:50,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i [2021-11-25 18:50:50,083 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/data/acde7c6ac/c57341cb418e4fbf8a235af1b2d0c999/FLAG3a7c61630 [2021-11-25 18:50:50,641 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:50:50,642 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i [2021-11-25 18:50:50,663 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/data/acde7c6ac/c57341cb418e4fbf8a235af1b2d0c999/FLAG3a7c61630 [2021-11-25 18:50:50,889 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/data/acde7c6ac/c57341cb418e4fbf8a235af1b2d0c999 [2021-11-25 18:50:50,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:50:50,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:50:50,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:50:50,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:50:50,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:50:50,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:50:50" (1/1) ... [2021-11-25 18:50:50,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e2a7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:50, skipping insertion in model container [2021-11-25 18:50:50,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:50:50" (1/1) ... [2021-11-25 18:50:50,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:50:50,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:50:51,188 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 18:50:51,487 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[47275,47288] [2021-11-25 18:50:51,493 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[47463,47476] [2021-11-25 18:50:51,504 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[48230,48243] [2021-11-25 18:50:51,507 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[48344,48357] [2021-11-25 18:50:51,511 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[48781,48794] [2021-11-25 18:50:51,512 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[48837,48850] [2021-11-25 18:50:51,520 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[49349,49362] [2021-11-25 18:50:51,521 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[49408,49421] [2021-11-25 18:50:51,522 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[49487,49500] [2021-11-25 18:50:51,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:50:51,530 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:50:51,545 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-25 18:50:51,577 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[47275,47288] [2021-11-25 18:50:51,583 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[47463,47476] [2021-11-25 18:50:51,588 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[48230,48243] [2021-11-25 18:50:51,591 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[48344,48357] [2021-11-25 18:50:51,596 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[48781,48794] [2021-11-25 18:50:51,599 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[48837,48850] [2021-11-25 18:50:51,605 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[49349,49362] [2021-11-25 18:50:51,610 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[49408,49421] [2021-11-25 18:50:51,611 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_7c49cb35-506a-45f8-b873-fb39ed88a1ac/sv-benchmarks/c/pthread-divine/divinefifo_1w1r.i[49487,49500] [2021-11-25 18:50:51,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:50:51,694 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:50:51,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51 WrapperNode [2021-11-25 18:50:51,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:50:51,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:50:51,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:50:51,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:50:51,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,804 INFO L137 Inliner]: procedures = 278, calls = 101, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 405 [2021-11-25 18:50:51,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:50:51,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:50:51,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:50:51,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:50:51,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:50:51,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:50:51,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:50:51,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:50:51,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (1/1) ... [2021-11-25 18:50:51,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:50:51,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:50:51,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:50:51,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:50:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2021-11-25 18:50:51,994 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2021-11-25 18:50:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:50:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 18:50:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:50:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:50:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:50:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 18:50:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:50:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 18:50:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:50:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:50:51,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:50:51,997 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 18:50:52,253 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:50:52,255 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:50:52,898 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:50:52,909 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:50:52,909 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-25 18:50:52,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:50:52 BoogieIcfgContainer [2021-11-25 18:50:52,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:50:52,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:50:52,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:50:52,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:50:52,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:50:50" (1/3) ... [2021-11-25 18:50:52,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14121ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:50:52, skipping insertion in model container [2021-11-25 18:50:52,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:50:51" (2/3) ... [2021-11-25 18:50:52,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14121ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:50:52, skipping insertion in model container [2021-11-25 18:50:52,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:50:52" (3/3) ... [2021-11-25 18:50:52,920 INFO L111 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2021-11-25 18:50:52,925 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 18:50:52,925 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:50:52,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-25 18:50:52,926 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 18:50:52,975 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,975 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,975 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,975 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,975 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,976 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,976 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,976 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,976 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,976 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,976 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,977 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,977 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,977 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,977 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,977 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,977 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,978 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,978 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,978 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,978 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,978 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,978 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,979 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,979 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,979 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,979 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,979 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,980 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,980 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 18:50:52,980 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,980 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 18:50:52,980 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,980 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,981 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,981 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 18:50:52,981 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,981 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 18:50:52,981 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 18:50:52,981 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,981 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 18:50:52,982 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 18:50:52,982 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 18:50:52,982 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 18:50:52,982 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 18:50:52,982 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 18:50:52,982 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 18:50:52,983 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,983 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 18:50:52,983 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 18:50:52,983 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 18:50:52,983 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 18:50:52,983 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 18:50:52,983 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 18:50:52,984 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 18:50:52,984 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 18:50:52,984 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,984 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 18:50:52,984 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 18:50:52,984 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 18:50:52,985 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 18:50:52,985 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 18:50:52,985 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 18:50:52,985 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 18:50:52,985 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 18:50:52,985 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 18:50:52,985 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,986 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 18:50:52,986 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 18:50:52,986 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 18:50:52,986 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 18:50:52,986 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 18:50:52,986 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 18:50:52,987 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 18:50:52,987 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,987 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 18:50:52,987 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 18:50:52,987 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 18:50:52,987 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 18:50:52,987 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 18:50:52,988 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 18:50:52,988 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 18:50:52,988 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 18:50:52,988 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,988 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 18:50:52,988 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 18:50:52,988 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 18:50:52,989 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 18:50:52,989 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 18:50:52,989 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 18:50:52,989 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 18:50:52,989 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 18:50:52,989 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 18:50:52,990 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 18:50:52,990 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,990 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,990 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 18:50:52,990 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 18:50:52,990 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,991 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,991 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,991 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,991 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,991 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,991 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 18:50:52,992 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 18:50:52,992 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 18:50:52,992 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 18:50:52,992 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,992 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,992 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 18:50:52,993 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 18:50:52,993 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,993 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,993 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 18:50:52,993 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 18:50:52,993 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 18:50:52,994 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 18:50:52,994 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 18:50:52,994 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 18:50:52,994 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 18:50:52,994 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 18:50:52,994 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 18:50:52,995 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 18:50:52,995 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,995 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,995 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 18:50:52,995 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 18:50:52,995 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,996 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:52,996 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 18:50:52,996 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 18:50:52,996 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 18:50:52,996 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 18:50:52,996 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 18:50:52,997 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 18:50:52,997 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 18:50:52,997 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 18:50:52,997 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 18:50:52,997 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 18:50:52,997 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 18:50:52,997 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 18:50:52,998 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 18:50:52,998 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 18:50:52,998 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 18:50:52,998 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 18:50:52,998 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 18:50:52,998 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 18:50:52,999 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 18:50:52,999 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 18:50:52,999 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 18:50:52,999 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 18:50:52,999 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 18:50:52,999 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 18:50:53,000 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 18:50:53,000 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 18:50:53,000 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 18:50:53,000 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 18:50:53,000 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 18:50:53,000 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 18:50:53,001 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 18:50:53,001 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 18:50:53,001 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 18:50:53,001 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 18:50:53,001 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 18:50:53,001 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 18:50:53,001 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 18:50:53,002 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 18:50:53,002 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 18:50:53,002 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 18:50:53,002 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 18:50:53,002 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 18:50:53,002 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 18:50:53,003 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 18:50:53,003 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 18:50:53,003 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 18:50:53,003 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,003 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,004 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 18:50:53,004 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 18:50:53,004 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,004 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,004 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 18:50:53,004 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 18:50:53,005 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 18:50:53,005 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 18:50:53,005 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 18:50:53,005 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 18:50:53,005 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 18:50:53,005 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 18:50:53,006 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 18:50:53,006 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 18:50:53,006 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 18:50:53,006 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 18:50:53,006 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 18:50:53,006 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 18:50:53,007 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 18:50:53,007 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 18:50:53,007 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 18:50:53,007 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 18:50:53,007 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 18:50:53,007 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 18:50:53,008 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 18:50:53,008 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 18:50:53,008 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 18:50:53,008 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 18:50:53,008 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 18:50:53,008 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 18:50:53,009 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 18:50:53,009 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 18:50:53,009 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 18:50:53,009 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 18:50:53,009 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 18:50:53,009 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 18:50:53,009 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 18:50:53,010 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 18:50:53,010 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 18:50:53,010 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 18:50:53,010 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 18:50:53,010 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 18:50:53,010 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 18:50:53,011 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,011 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 18:50:53,011 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 18:50:53,011 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,011 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 18:50:53,011 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 18:50:53,012 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 18:50:53,012 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 18:50:53,012 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 18:50:53,012 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 18:50:53,012 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 18:50:53,012 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 18:50:53,012 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 18:50:53,013 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 18:50:53,013 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 18:50:53,013 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 18:50:53,013 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 18:50:53,013 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 18:50:53,013 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 18:50:53,014 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 18:50:53,014 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 18:50:53,014 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 18:50:53,014 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 18:50:53,014 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 18:50:53,015 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 18:50:53,015 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 18:50:53,015 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 18:50:53,015 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 18:50:53,015 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 18:50:53,015 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 18:50:53,016 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 18:50:53,016 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 18:50:53,016 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 18:50:53,016 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 18:50:53,016 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 18:50:53,016 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 18:50:53,017 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 18:50:53,017 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 18:50:53,017 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 18:50:53,017 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 18:50:53,017 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 18:50:53,017 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 18:50:53,018 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 18:50:53,018 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 18:50:53,018 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 18:50:53,018 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 18:50:53,018 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 18:50:53,018 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 18:50:53,019 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 18:50:53,019 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 18:50:53,019 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 18:50:53,019 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 18:50:53,019 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 18:50:53,020 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 18:50:53,020 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 18:50:53,020 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 18:50:53,020 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 18:50:53,020 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 18:50:53,020 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 18:50:53,020 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 18:50:53,021 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 18:50:53,021 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 18:50:53,021 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 18:50:53,021 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 18:50:53,021 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 18:50:53,021 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 18:50:53,022 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 18:50:53,022 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 18:50:53,022 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 18:50:53,022 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 18:50:53,022 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 18:50:53,022 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 18:50:53,022 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 18:50:53,023 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 18:50:53,023 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 18:50:53,023 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 18:50:53,023 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 18:50:53,023 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,023 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,024 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 18:50:53,024 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 18:50:53,024 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,024 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,024 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 18:50:53,024 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 18:50:53,025 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 18:50:53,025 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 18:50:53,025 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 18:50:53,025 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 18:50:53,025 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 18:50:53,025 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 18:50:53,025 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 18:50:53,026 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 18:50:53,026 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 18:50:53,026 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 18:50:53,026 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 18:50:53,026 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 18:50:53,026 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 18:50:53,026 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 18:50:53,027 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 18:50:53,027 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 18:50:53,027 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 18:50:53,027 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 18:50:53,027 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 18:50:53,027 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 18:50:53,028 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 18:50:53,028 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 18:50:53,028 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 18:50:53,028 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 18:50:53,028 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 18:50:53,028 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 18:50:53,028 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 18:50:53,029 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 18:50:53,029 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 18:50:53,029 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 18:50:53,029 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 18:50:53,029 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 18:50:53,029 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 18:50:53,029 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 18:50:53,030 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 18:50:53,030 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 18:50:53,030 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 18:50:53,030 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 18:50:53,031 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 18:50:53,031 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 18:50:53,032 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,032 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,032 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 18:50:53,032 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 18:50:53,032 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,032 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,033 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 18:50:53,033 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 18:50:53,033 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 18:50:53,033 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 18:50:53,033 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 18:50:53,033 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 18:50:53,034 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 18:50:53,034 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 18:50:53,034 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 18:50:53,034 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 18:50:53,034 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,034 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,035 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,035 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,035 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 18:50:53,035 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 18:50:53,035 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 18:50:53,035 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 18:50:53,035 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,036 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,036 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,036 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,036 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,036 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 18:50:53,036 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 18:50:53,037 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,037 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,037 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 18:50:53,037 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 18:50:53,037 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,038 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,038 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,041 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 18:50:53,041 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 18:50:53,041 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 18:50:53,041 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 18:50:53,041 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 18:50:53,042 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 18:50:53,042 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 18:50:53,042 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 18:50:53,042 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 18:50:53,042 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,042 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,043 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,043 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 18:50:53,043 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,043 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 18:50:53,043 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 18:50:53,043 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,044 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 18:50:53,044 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 18:50:53,044 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 18:50:53,044 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 18:50:53,044 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,044 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,045 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,045 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,045 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 18:50:53,045 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 18:50:53,045 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 18:50:53,045 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 18:50:53,045 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 18:50:53,046 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 18:50:53,046 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 18:50:53,046 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 18:50:53,046 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 18:50:53,046 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,046 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 18:50:53,047 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 18:50:53,083 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 18:50:53,083 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 18:50:53,083 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,083 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 18:50:53,084 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 18:50:53,084 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 18:50:53,084 WARN L322 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:50:53,088 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-11-25 18:50:53,131 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:50:53,137 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 18:50:53,138 INFO L340 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-11-25 18:50:53,158 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 18:50:53,170 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 467 places, 495 transitions, 998 flow [2021-11-25 18:50:53,172 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 467 places, 495 transitions, 998 flow [2021-11-25 18:50:53,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 467 places, 495 transitions, 998 flow [2021-11-25 18:50:53,390 INFO L129 PetriNetUnfolder]: 32/494 cut-off events. [2021-11-25 18:50:53,391 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-25 18:50:53,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 494 events. 32/494 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1131 event pairs, 0 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 340. Up to 3 conditions per place. [2021-11-25 18:50:53,438 INFO L116 LiptonReduction]: Number of co-enabled transitions 35328 [2021-11-25 18:51:37,697 INFO L131 LiptonReduction]: Checked pairs total: 117265 [2021-11-25 18:51:37,697 INFO L133 LiptonReduction]: Total number of compositions: 524 [2021-11-25 18:51:37,707 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 119 transitions, 246 flow [2021-11-25 18:51:37,768 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1413 states, 1402 states have (on average 2.3067047075606277) internal successors, (3234), 1412 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 1413 states, 1402 states have (on average 2.3067047075606277) internal successors, (3234), 1412 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-11-25 18:51:37,778 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:37,779 INFO L514 BasicCegarLoop]: trace histogram [1] [2021-11-25 18:51:37,779 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 18:51:37,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1746, now seen corresponding path program 1 times [2021-11-25 18:51:37,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:37,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251043121] [2021-11-25 18:51:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:37,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:37,900 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 18:51:37,900 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:37,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251043121] [2021-11-25 18:51:37,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251043121] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:37,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:37,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-11-25 18:51:37,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319750281] [2021-11-25 18:51:37,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:37,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 18:51:37,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:37,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 18:51:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:51:37,935 INFO L87 Difference]: Start difference. First operand has 1413 states, 1402 states have (on average 2.3067047075606277) internal successors, (3234), 1412 states have internal predecessors, (3234), 0 states have call successors, (0), 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 18:51:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:38,138 INFO L93 Difference]: Finished difference Result 1412 states and 3157 transitions. [2021-11-25 18:51:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 18:51:38,141 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 18:51:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:38,166 INFO L225 Difference]: With dead ends: 1412 [2021-11-25 18:51:38,167 INFO L226 Difference]: Without dead ends: 1412 [2021-11-25 18:51:38,167 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 18:51:38,171 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:38,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:51:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2021-11-25 18:51:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2021-11-25 18:51:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1402 states have (on average 2.2517831669044224) internal successors, (3157), 1411 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3157 transitions. [2021-11-25 18:51:38,287 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3157 transitions. Word has length 1 [2021-11-25 18:51:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:38,287 INFO L470 AbstractCegarLoop]: Abstraction has 1412 states and 3157 transitions. [2021-11-25 18:51:38,287 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 18:51:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3157 transitions. [2021-11-25 18:51:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 18:51:38,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:38,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 18:51:38,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:51:38,289 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 18:51:38,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash -368069748, now seen corresponding path program 1 times [2021-11-25 18:51:38,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:38,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136150161] [2021-11-25 18:51:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:38,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:38,507 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 18:51:38,508 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:38,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136150161] [2021-11-25 18:51:38,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136150161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:38,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:38,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:51:38,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472830641] [2021-11-25 18:51:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:38,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:51:38,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:51:38,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:51:38,512 INFO L87 Difference]: Start difference. First operand 1412 states and 3157 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 18:51:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:38,829 INFO L93 Difference]: Finished difference Result 2647 states and 5928 transitions. [2021-11-25 18:51:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:51:38,829 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 18:51:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:38,850 INFO L225 Difference]: With dead ends: 2647 [2021-11-25 18:51:38,850 INFO L226 Difference]: Without dead ends: 2647 [2021-11-25 18:51:38,850 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 18:51:38,852 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 94 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:38,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 46 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:51:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2021-11-25 18:51:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1431. [2021-11-25 18:51:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1421 states have (on average 2.2498240675580576) internal successors, (3197), 1430 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2021-11-25 18:51:38,915 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 6 [2021-11-25 18:51:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:38,916 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2021-11-25 18:51:38,916 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 18:51:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2021-11-25 18:51:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 18:51:38,917 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:38,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:38,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:51:38,918 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 18:51:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1476874622, now seen corresponding path program 1 times [2021-11-25 18:51:38,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:38,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787208759] [2021-11-25 18:51:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:38,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:39,006 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 18:51:39,007 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:39,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787208759] [2021-11-25 18:51:39,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787208759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:39,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:39,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:51:39,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675192730] [2021-11-25 18:51:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:39,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:51:39,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:51:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:51:39,010 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 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 18:51:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:39,210 INFO L93 Difference]: Finished difference Result 1431 states and 3178 transitions. [2021-11-25 18:51:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:51:39,210 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 18:51:39,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:39,221 INFO L225 Difference]: With dead ends: 1431 [2021-11-25 18:51:39,221 INFO L226 Difference]: Without dead ends: 1431 [2021-11-25 18:51:39,222 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 18:51:39,223 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 107 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:39,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 29 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:51:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2021-11-25 18:51:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2021-11-25 18:51:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1421 states have (on average 2.2364532019704435) internal successors, (3178), 1430 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3178 transitions. [2021-11-25 18:51:39,270 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3178 transitions. Word has length 7 [2021-11-25 18:51:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:39,271 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 3178 transitions. [2021-11-25 18:51:39,271 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 18:51:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3178 transitions. [2021-11-25 18:51:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 18:51:39,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:39,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:39,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 18:51:39,273 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 18:51:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1453226834, now seen corresponding path program 1 times [2021-11-25 18:51:39,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:39,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980313840] [2021-11-25 18:51:39,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:39,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:39,501 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 18:51:39,501 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:39,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980313840] [2021-11-25 18:51:39,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980313840] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:39,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:39,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:51:39,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8829357] [2021-11-25 18:51:39,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:39,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:51:39,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:39,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:51:39,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:51:39,504 INFO L87 Difference]: Start difference. First operand 1431 states and 3178 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 18:51:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:40,087 INFO L93 Difference]: Finished difference Result 1817 states and 4039 transitions. [2021-11-25 18:51:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:51:40,087 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 18:51:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:40,100 INFO L225 Difference]: With dead ends: 1817 [2021-11-25 18:51:40,100 INFO L226 Difference]: Without dead ends: 1817 [2021-11-25 18:51:40,101 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 18:51:40,102 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 127 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:40,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 25 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:51:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2021-11-25 18:51:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1538. [2021-11-25 18:51:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1528 states have (on average 2.240183246073298) internal successors, (3423), 1537 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3423 transitions. [2021-11-25 18:51:40,152 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3423 transitions. Word has length 8 [2021-11-25 18:51:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:40,153 INFO L470 AbstractCegarLoop]: Abstraction has 1538 states and 3423 transitions. [2021-11-25 18:51:40,153 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 18:51:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3423 transitions. [2021-11-25 18:51:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 18:51:40,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:40,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:40,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 18:51:40,155 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 18:51:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash -686313702, now seen corresponding path program 1 times [2021-11-25 18:51:40,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:40,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251746002] [2021-11-25 18:51:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:40,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:40,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 18:51:40,244 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:40,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251746002] [2021-11-25 18:51:40,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251746002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:40,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:40,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:51:40,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50688834] [2021-11-25 18:51:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:40,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:51:40,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:40,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:51:40,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:51:40,246 INFO L87 Difference]: Start difference. First operand 1538 states and 3423 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 18:51:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:40,457 INFO L93 Difference]: Finished difference Result 1557 states and 3463 transitions. [2021-11-25 18:51:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:51:40,458 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 18:51:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:40,469 INFO L225 Difference]: With dead ends: 1557 [2021-11-25 18:51:40,469 INFO L226 Difference]: Without dead ends: 1557 [2021-11-25 18:51:40,470 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 18:51:40,471 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:40,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:51:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2021-11-25 18:51:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2021-11-25 18:51:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1547 states have (on average 2.2385261797026503) internal successors, (3463), 1556 states have internal predecessors, (3463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3463 transitions. [2021-11-25 18:51:40,532 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3463 transitions. Word has length 10 [2021-11-25 18:51:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:40,533 INFO L470 AbstractCegarLoop]: Abstraction has 1557 states and 3463 transitions. [2021-11-25 18:51:40,533 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 18:51:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3463 transitions. [2021-11-25 18:51:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 18:51:40,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:40,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:40,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 18:51:40,543 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 18:51:40,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:40,545 INFO L85 PathProgramCache]: Analyzing trace with hash 987595614, now seen corresponding path program 1 times [2021-11-25 18:51:40,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:40,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773017264] [2021-11-25 18:51:40,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:40,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:40,800 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 18:51:40,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:40,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773017264] [2021-11-25 18:51:40,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773017264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:40,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:40,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 18:51:40,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039898163] [2021-11-25 18:51:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:40,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:51:40,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:51:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:51:40,803 INFO L87 Difference]: Start difference. First operand 1557 states and 3463 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 18:51:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:42,632 INFO L93 Difference]: Finished difference Result 2206 states and 4906 transitions. [2021-11-25 18:51:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:51:42,633 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 18:51:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:42,652 INFO L225 Difference]: With dead ends: 2206 [2021-11-25 18:51:42,652 INFO L226 Difference]: Without dead ends: 2206 [2021-11-25 18:51:42,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2021-11-25 18:51:42,655 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 441 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:42,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 30 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 18:51:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2021-11-25 18:51:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1571. [2021-11-25 18:51:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1561 states have (on average 2.238949391415759) internal successors, (3495), 1570 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 3495 transitions. [2021-11-25 18:51:42,718 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 3495 transitions. Word has length 14 [2021-11-25 18:51:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:42,719 INFO L470 AbstractCegarLoop]: Abstraction has 1571 states and 3495 transitions. [2021-11-25 18:51:42,719 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 18:51:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 3495 transitions. [2021-11-25 18:51:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 18:51:42,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:42,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:42,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 18:51:42,721 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:51:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash 85567050, now seen corresponding path program 2 times [2021-11-25 18:51:42,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:42,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716399500] [2021-11-25 18:51:42,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:42,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:42,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 18:51:42,903 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716399500] [2021-11-25 18:51:42,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716399500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:42,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:42,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 18:51:42,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56974710] [2021-11-25 18:51:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:42,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 18:51:42,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 18:51:42,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:51:42,906 INFO L87 Difference]: Start difference. First operand 1571 states and 3495 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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 18:51:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:44,431 INFO L93 Difference]: Finished difference Result 1981 states and 4388 transitions. [2021-11-25 18:51:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:51:44,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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 18:51:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:44,446 INFO L225 Difference]: With dead ends: 1981 [2021-11-25 18:51:44,447 INFO L226 Difference]: Without dead ends: 1981 [2021-11-25 18:51:44,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:51:44,448 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 469 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:44,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 26 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 18:51:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2021-11-25 18:51:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1566. [2021-11-25 18:51:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1556 states have (on average 2.238431876606684) internal successors, (3483), 1565 states have internal predecessors, (3483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 3483 transitions. [2021-11-25 18:51:44,501 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 3483 transitions. Word has length 14 [2021-11-25 18:51:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:44,502 INFO L470 AbstractCegarLoop]: Abstraction has 1566 states and 3483 transitions. [2021-11-25 18:51:44,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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 18:51:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 3483 transitions. [2021-11-25 18:51:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 18:51:44,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:44,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:44,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 18:51:44,504 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:51:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1767664317, now seen corresponding path program 1 times [2021-11-25 18:51:44,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:44,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85037744] [2021-11-25 18:51:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:44,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:44,662 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 18:51:44,662 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:44,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85037744] [2021-11-25 18:51:44,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85037744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:44,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:44,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 18:51:44,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199000703] [2021-11-25 18:51:44,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:44,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:51:44,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:51:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:51:44,664 INFO L87 Difference]: Start difference. First operand 1566 states and 3483 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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 18:51:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:45,636 INFO L93 Difference]: Finished difference Result 2142 states and 4716 transitions. [2021-11-25 18:51:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:51:45,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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 18:51:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:45,650 INFO L225 Difference]: With dead ends: 2142 [2021-11-25 18:51:45,651 INFO L226 Difference]: Without dead ends: 2085 [2021-11-25 18:51:45,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:51:45,653 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 225 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:45,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 28 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 18:51:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2021-11-25 18:51:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1616. [2021-11-25 18:51:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1606 states have (on average 2.240348692403487) internal successors, (3598), 1615 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 3598 transitions. [2021-11-25 18:51:45,708 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 3598 transitions. Word has length 14 [2021-11-25 18:51:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:45,709 INFO L470 AbstractCegarLoop]: Abstraction has 1616 states and 3598 transitions. [2021-11-25 18:51:45,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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 18:51:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 3598 transitions. [2021-11-25 18:51:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:51:45,710 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:45,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:45,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 18:51:45,710 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 18:51:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -592122702, now seen corresponding path program 1 times [2021-11-25 18:51:45,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:45,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184950619] [2021-11-25 18:51:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:45,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:45,953 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 18:51:45,953 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:45,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184950619] [2021-11-25 18:51:45,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184950619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:45,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:45,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 18:51:45,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736349785] [2021-11-25 18:51:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:45,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:51:45,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:51:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:51:45,955 INFO L87 Difference]: Start difference. First operand 1616 states and 3598 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 18:51:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:46,920 INFO L93 Difference]: Finished difference Result 2133 states and 4745 transitions. [2021-11-25 18:51:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:51:46,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 18:51:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:46,935 INFO L225 Difference]: With dead ends: 2133 [2021-11-25 18:51:46,935 INFO L226 Difference]: Without dead ends: 2133 [2021-11-25 18:51:46,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:51:46,936 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 203 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:46,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 17 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 18:51:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2021-11-25 18:51:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 1679. [2021-11-25 18:51:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1669 states have (on average 2.2408627920910726) internal successors, (3740), 1678 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3740 transitions. [2021-11-25 18:51:46,990 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3740 transitions. Word has length 15 [2021-11-25 18:51:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:46,990 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 3740 transitions. [2021-11-25 18:51:46,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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 18:51:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3740 transitions. [2021-11-25 18:51:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:51:46,992 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:46,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:46,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 18:51:46,992 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 18:51:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1884536264, now seen corresponding path program 2 times [2021-11-25 18:51:46,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:46,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138617156] [2021-11-25 18:51:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:46,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:47,453 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 18:51:47,453 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:47,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138617156] [2021-11-25 18:51:47,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138617156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:47,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:47,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:51:47,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115375239] [2021-11-25 18:51:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:47,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:51:47,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:51:47,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:51:47,455 INFO L87 Difference]: Start difference. First operand 1679 states and 3740 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 18:51:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:50,139 INFO L93 Difference]: Finished difference Result 2335 states and 5178 transitions. [2021-11-25 18:51:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 18:51:50,139 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 18:51:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:50,154 INFO L225 Difference]: With dead ends: 2335 [2021-11-25 18:51:50,155 INFO L226 Difference]: Without dead ends: 2335 [2021-11-25 18:51:50,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=265, Invalid=727, Unknown=0, NotChecked=0, Total=992 [2021-11-25 18:51:50,156 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 433 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:50,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 30 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 18:51:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2021-11-25 18:51:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1695. [2021-11-25 18:51:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1685 states have (on average 2.2421364985163206) internal successors, (3778), 1694 states have internal predecessors, (3778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 3778 transitions. [2021-11-25 18:51:50,211 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 3778 transitions. Word has length 15 [2021-11-25 18:51:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:50,211 INFO L470 AbstractCegarLoop]: Abstraction has 1695 states and 3778 transitions. [2021-11-25 18:51:50,211 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 18:51:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3778 transitions. [2021-11-25 18:51:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:51:50,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:50,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:50,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 18:51:50,213 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 18:51:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1338192741, now seen corresponding path program 1 times [2021-11-25 18:51:50,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:50,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268327926] [2021-11-25 18:51:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:50,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:50,445 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 18:51:50,445 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:50,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268327926] [2021-11-25 18:51:50,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268327926] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:50,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:50,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:51:50,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205688962] [2021-11-25 18:51:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:50,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:51:50,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:50,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:51:50,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:51:50,447 INFO L87 Difference]: Start difference. First operand 1695 states and 3778 transitions. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 18:51:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:52,201 INFO L93 Difference]: Finished difference Result 2360 states and 5232 transitions. [2021-11-25 18:51:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:51:52,201 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 18:51:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:52,215 INFO L225 Difference]: With dead ends: 2360 [2021-11-25 18:51:52,215 INFO L226 Difference]: Without dead ends: 2360 [2021-11-25 18:51:52,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:51:52,216 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 414 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:52,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 32 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:51:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2021-11-25 18:51:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1733. [2021-11-25 18:51:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1723 states have (on average 2.2426001160766105) internal successors, (3864), 1732 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 3864 transitions. [2021-11-25 18:51:52,270 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 3864 transitions. Word has length 15 [2021-11-25 18:51:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:52,270 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 3864 transitions. [2021-11-25 18:51:52,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 18:51:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 3864 transitions. [2021-11-25 18:51:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:51:52,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:52,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:52,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 18:51:52,273 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 18:51:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash -420856288, now seen corresponding path program 3 times [2021-11-25 18:51:52,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:52,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186894430] [2021-11-25 18:51:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:52,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:52,633 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 18:51:52,633 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:52,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186894430] [2021-11-25 18:51:52,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186894430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:52,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:52,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:51:52,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459806689] [2021-11-25 18:51:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:52,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:51:52,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:51:52,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:51:52,635 INFO L87 Difference]: Start difference. First operand 1733 states and 3864 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 18:51:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:55,948 INFO L93 Difference]: Finished difference Result 2357 states and 5233 transitions. [2021-11-25 18:51:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 18:51:55,949 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 18:51:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:55,954 INFO L225 Difference]: With dead ends: 2357 [2021-11-25 18:51:55,955 INFO L226 Difference]: Without dead ends: 2357 [2021-11-25 18:51:55,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=402, Invalid=1158, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:51:55,956 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 552 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:55,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 35 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:51:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2021-11-25 18:51:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1747. [2021-11-25 18:51:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1737 states have (on average 2.2417962003454233) internal successors, (3894), 1746 states have internal predecessors, (3894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 3894 transitions. [2021-11-25 18:51:56,020 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 3894 transitions. Word has length 15 [2021-11-25 18:51:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:56,021 INFO L470 AbstractCegarLoop]: Abstraction has 1747 states and 3894 transitions. [2021-11-25 18:51:56,021 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 18:51:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3894 transitions. [2021-11-25 18:51:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:51:56,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:56,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:56,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 18:51:56,023 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 18:51:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash -952372931, now seen corresponding path program 2 times [2021-11-25 18:51:56,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:56,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349880756] [2021-11-25 18:51:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:56,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:56,262 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 18:51:56,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:56,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349880756] [2021-11-25 18:51:56,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349880756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:56,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:56,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:51:56,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648468746] [2021-11-25 18:51:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:56,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:51:56,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:56,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:51:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:51:56,267 INFO L87 Difference]: Start difference. First operand 1747 states and 3894 transitions. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 18:51:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:51:59,036 INFO L93 Difference]: Finished difference Result 2829 states and 6241 transitions. [2021-11-25 18:51:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 18:51:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 18:51:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:51:59,044 INFO L225 Difference]: With dead ends: 2829 [2021-11-25 18:51:59,045 INFO L226 Difference]: Without dead ends: 2829 [2021-11-25 18:51:59,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=455, Invalid=1105, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:51:59,046 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 634 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 3137 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:51:59,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 36 Invalid, 3200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3137 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 18:51:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2021-11-25 18:51:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 1744. [2021-11-25 18:51:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1734 states have (on average 2.2416378316032297) internal successors, (3887), 1743 states have internal predecessors, (3887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:51:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 3887 transitions. [2021-11-25 18:51:59,100 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 3887 transitions. Word has length 15 [2021-11-25 18:51:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:51:59,100 INFO L470 AbstractCegarLoop]: Abstraction has 1744 states and 3887 transitions. [2021-11-25 18:51:59,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 18:51:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3887 transitions. [2021-11-25 18:51:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:51:59,102 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:51:59,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:51:59,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 18:51:59,102 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 18:51:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:51:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash 646816838, now seen corresponding path program 4 times [2021-11-25 18:51:59,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:51:59,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577835156] [2021-11-25 18:51:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:51:59,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:51:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:51:59,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 18:51:59,379 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:51:59,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577835156] [2021-11-25 18:51:59,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577835156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:51:59,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:51:59,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:51:59,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382588897] [2021-11-25 18:51:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:51:59,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:51:59,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:51:59,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:51:59,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:51:59,381 INFO L87 Difference]: Start difference. First operand 1744 states and 3887 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 18:52:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:02,377 INFO L93 Difference]: Finished difference Result 2231 states and 4946 transitions. [2021-11-25 18:52:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 18:52:02,378 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 18:52:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:02,383 INFO L225 Difference]: With dead ends: 2231 [2021-11-25 18:52:02,383 INFO L226 Difference]: Without dead ends: 2231 [2021-11-25 18:52:02,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=447, Invalid=1275, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 18:52:02,385 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 579 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:02,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 35 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 18:52:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-11-25 18:52:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1737. [2021-11-25 18:52:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1727 states have (on average 2.2420382165605095) internal successors, (3872), 1736 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 3872 transitions. [2021-11-25 18:52:02,432 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 3872 transitions. Word has length 15 [2021-11-25 18:52:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:02,432 INFO L470 AbstractCegarLoop]: Abstraction has 1737 states and 3872 transitions. [2021-11-25 18:52:02,432 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 18:52:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 3872 transitions. [2021-11-25 18:52:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:02,434 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:02,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:02,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 18:52:02,434 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 18:52:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1916166736, now seen corresponding path program 5 times [2021-11-25 18:52:02,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:02,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486455307] [2021-11-25 18:52:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:02,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:02,723 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 18:52:02,723 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:02,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486455307] [2021-11-25 18:52:02,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486455307] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:02,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:02,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:52:02,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626375678] [2021-11-25 18:52:02,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:02,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:52:02,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:02,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:52:02,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:52:02,725 INFO L87 Difference]: Start difference. First operand 1737 states and 3872 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 18:52:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:05,609 INFO L93 Difference]: Finished difference Result 2223 states and 4928 transitions. [2021-11-25 18:52:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 18:52:05,610 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 18:52:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:05,615 INFO L225 Difference]: With dead ends: 2223 [2021-11-25 18:52:05,615 INFO L226 Difference]: Without dead ends: 2223 [2021-11-25 18:52:05,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=499, Invalid=1481, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:52:05,617 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 663 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:05,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 25 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 18:52:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2021-11-25 18:52:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1741. [2021-11-25 18:52:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1731 states have (on average 2.241478913922588) internal successors, (3880), 1740 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 3880 transitions. [2021-11-25 18:52:05,664 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 3880 transitions. Word has length 15 [2021-11-25 18:52:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:05,665 INFO L470 AbstractCegarLoop]: Abstraction has 1741 states and 3880 transitions. [2021-11-25 18:52:05,665 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 18:52:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 3880 transitions. [2021-11-25 18:52:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:05,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:05,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:05,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 18:52:05,667 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 18:52:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1909588788, now seen corresponding path program 6 times [2021-11-25 18:52:05,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:05,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079834500] [2021-11-25 18:52:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:05,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:05,978 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 18:52:05,978 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:05,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079834500] [2021-11-25 18:52:05,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079834500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:05,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:05,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:52:05,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864855555] [2021-11-25 18:52:05,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:05,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:52:05,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:52:05,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:52:05,980 INFO L87 Difference]: Start difference. First operand 1741 states and 3880 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 18:52:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:09,442 INFO L93 Difference]: Finished difference Result 2230 states and 4943 transitions. [2021-11-25 18:52:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 18:52:09,444 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 18:52:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:09,450 INFO L225 Difference]: With dead ends: 2230 [2021-11-25 18:52:09,450 INFO L226 Difference]: Without dead ends: 2230 [2021-11-25 18:52:09,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=1502, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:52:09,451 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 580 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 3359 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:09,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 37 Invalid, 3411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3359 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 18:52:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2021-11-25 18:52:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1732. [2021-11-25 18:52:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1722 states have (on average 2.2409988385598143) internal successors, (3859), 1731 states have internal predecessors, (3859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 3859 transitions. [2021-11-25 18:52:09,497 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 3859 transitions. Word has length 15 [2021-11-25 18:52:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:09,497 INFO L470 AbstractCegarLoop]: Abstraction has 1732 states and 3859 transitions. [2021-11-25 18:52:09,498 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 18:52:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 3859 transitions. [2021-11-25 18:52:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:09,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:09,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:09,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 18:52:09,500 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 18:52:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1835759261, now seen corresponding path program 3 times [2021-11-25 18:52:09,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:09,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633785567] [2021-11-25 18:52:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:09,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:09,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 18:52:09,682 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633785567] [2021-11-25 18:52:09,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633785567] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:09,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:09,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:52:09,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520979583] [2021-11-25 18:52:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:09,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:52:09,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:52:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:52:09,684 INFO L87 Difference]: Start difference. First operand 1732 states and 3859 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 18:52:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:11,649 INFO L93 Difference]: Finished difference Result 2280 states and 5045 transitions. [2021-11-25 18:52:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 18:52:11,649 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 18:52:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:11,655 INFO L225 Difference]: With dead ends: 2280 [2021-11-25 18:52:11,655 INFO L226 Difference]: Without dead ends: 2280 [2021-11-25 18:52:11,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 18:52:11,656 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 601 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:11,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 32 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 18:52:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2021-11-25 18:52:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1725. [2021-11-25 18:52:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1715 states have (on average 2.241399416909621) internal successors, (3844), 1724 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3844 transitions. [2021-11-25 18:52:11,702 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3844 transitions. Word has length 15 [2021-11-25 18:52:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:11,702 INFO L470 AbstractCegarLoop]: Abstraction has 1725 states and 3844 transitions. [2021-11-25 18:52:11,702 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 18:52:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3844 transitions. [2021-11-25 18:52:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:11,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:11,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:11,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 18:52:11,704 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 18:52:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1012811547, now seen corresponding path program 4 times [2021-11-25 18:52:11,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:11,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213165061] [2021-11-25 18:52:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:11,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:11,872 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 18:52:11,873 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213165061] [2021-11-25 18:52:11,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213165061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:11,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:11,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 18:52:11,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100599782] [2021-11-25 18:52:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:11,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:52:11,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:52:11,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:52:11,874 INFO L87 Difference]: Start difference. First operand 1725 states and 3844 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 18:52:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:13,515 INFO L93 Difference]: Finished difference Result 2302 states and 5090 transitions. [2021-11-25 18:52:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 18:52:13,516 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 18:52:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:13,520 INFO L225 Difference]: With dead ends: 2302 [2021-11-25 18:52:13,520 INFO L226 Difference]: Without dead ends: 2302 [2021-11-25 18:52:13,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2021-11-25 18:52:13,521 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 519 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:13,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 30 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 18:52:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2021-11-25 18:52:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 1724. [2021-11-25 18:52:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1714 states have (on average 2.2403733955659275) internal successors, (3840), 1723 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3840 transitions. [2021-11-25 18:52:13,562 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3840 transitions. Word has length 15 [2021-11-25 18:52:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:13,562 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 3840 transitions. [2021-11-25 18:52:13,562 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 18:52:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3840 transitions. [2021-11-25 18:52:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:13,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:13,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:13,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 18:52:13,564 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 18:52:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash 75053068, now seen corresponding path program 7 times [2021-11-25 18:52:13,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:13,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047254161] [2021-11-25 18:52:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:13,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:13,718 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 18:52:13,719 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:13,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047254161] [2021-11-25 18:52:13,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047254161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:13,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:13,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 18:52:13,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357014603] [2021-11-25 18:52:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:13,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:52:13,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:13,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:52:13,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:52:13,721 INFO L87 Difference]: Start difference. First operand 1724 states and 3840 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 18:52:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:14,350 INFO L93 Difference]: Finished difference Result 2309 states and 5129 transitions. [2021-11-25 18:52:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:52:14,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 18:52:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:14,354 INFO L225 Difference]: With dead ends: 2309 [2021-11-25 18:52:14,355 INFO L226 Difference]: Without dead ends: 2309 [2021-11-25 18:52:14,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:52:14,356 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 210 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:14,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 15 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:52:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2021-11-25 18:52:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 1777. [2021-11-25 18:52:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1767 states have (on average 2.2410865874363326) internal successors, (3960), 1776 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 3960 transitions. [2021-11-25 18:52:14,397 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 3960 transitions. Word has length 15 [2021-11-25 18:52:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:14,398 INFO L470 AbstractCegarLoop]: Abstraction has 1777 states and 3960 transitions. [2021-11-25 18:52:14,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 18:52:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 3960 transitions. [2021-11-25 18:52:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:14,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:14,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:14,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 18:52:14,400 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 18:52:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash 940771076, now seen corresponding path program 8 times [2021-11-25 18:52:14,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:14,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247709440] [2021-11-25 18:52:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:14,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:14,858 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 18:52:14,858 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:14,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247709440] [2021-11-25 18:52:14,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247709440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:14,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:14,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:52:14,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874318892] [2021-11-25 18:52:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:14,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:52:14,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:52:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:52:14,860 INFO L87 Difference]: Start difference. First operand 1777 states and 3960 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 18:52:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:16,761 INFO L93 Difference]: Finished difference Result 2610 states and 5778 transitions. [2021-11-25 18:52:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 18:52:16,761 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 18:52:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:16,765 INFO L225 Difference]: With dead ends: 2610 [2021-11-25 18:52:16,765 INFO L226 Difference]: Without dead ends: 2610 [2021-11-25 18:52:16,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2021-11-25 18:52:16,766 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 391 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:16,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 32 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 18:52:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2021-11-25 18:52:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 1779. [2021-11-25 18:52:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1769 states have (on average 2.241944601469757) internal successors, (3966), 1778 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 3966 transitions. [2021-11-25 18:52:16,809 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 3966 transitions. Word has length 15 [2021-11-25 18:52:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:16,810 INFO L470 AbstractCegarLoop]: Abstraction has 1779 states and 3966 transitions. [2021-11-25 18:52:16,810 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 18:52:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 3966 transitions. [2021-11-25 18:52:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:16,811 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:16,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:16,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-25 18:52:16,812 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 18:52:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:16,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1361995700, now seen corresponding path program 9 times [2021-11-25 18:52:16,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:16,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789161966] [2021-11-25 18:52:16,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:16,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:17,102 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 18:52:17,102 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:17,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789161966] [2021-11-25 18:52:17,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789161966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:17,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:17,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:52:17,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741189321] [2021-11-25 18:52:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:17,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:52:17,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:52:17,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:52:17,104 INFO L87 Difference]: Start difference. First operand 1779 states and 3966 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 18:52:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:19,855 INFO L93 Difference]: Finished difference Result 2636 states and 5845 transitions. [2021-11-25 18:52:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:52:19,856 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 18:52:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:19,859 INFO L225 Difference]: With dead ends: 2636 [2021-11-25 18:52:19,859 INFO L226 Difference]: Without dead ends: 2636 [2021-11-25 18:52:19,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=416, Invalid=1066, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:52:19,860 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 607 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:19,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 27 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2654 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 18:52:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2021-11-25 18:52:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 1742. [2021-11-25 18:52:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1732 states have (on average 2.239030023094688) internal successors, (3878), 1741 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 3878 transitions. [2021-11-25 18:52:19,921 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 3878 transitions. Word has length 15 [2021-11-25 18:52:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:19,923 INFO L470 AbstractCegarLoop]: Abstraction has 1742 states and 3878 transitions. [2021-11-25 18:52:19,923 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 18:52:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3878 transitions. [2021-11-25 18:52:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:19,925 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:19,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:19,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 18:52:19,926 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 18:52:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1172369940, now seen corresponding path program 10 times [2021-11-25 18:52:19,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:19,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121839064] [2021-11-25 18:52:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:19,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:20,087 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 18:52:20,088 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:20,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121839064] [2021-11-25 18:52:20,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121839064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:20,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:20,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 18:52:20,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801629452] [2021-11-25 18:52:20,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:20,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:52:20,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:52:20,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:52:20,090 INFO L87 Difference]: Start difference. First operand 1742 states and 3878 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 18:52:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:20,774 INFO L93 Difference]: Finished difference Result 2051 states and 4528 transitions. [2021-11-25 18:52:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:52:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 18:52:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:20,786 INFO L225 Difference]: With dead ends: 2051 [2021-11-25 18:52:20,786 INFO L226 Difference]: Without dead ends: 2051 [2021-11-25 18:52:20,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:52:20,787 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 120 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:20,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 24 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:52:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2021-11-25 18:52:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1672. [2021-11-25 18:52:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1662 states have (on average 2.2364620938628157) internal successors, (3717), 1671 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 3717 transitions. [2021-11-25 18:52:20,820 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 3717 transitions. Word has length 15 [2021-11-25 18:52:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:20,821 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 3717 transitions. [2021-11-25 18:52:20,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 18:52:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 3717 transitions. [2021-11-25 18:52:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:20,822 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:20,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:20,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-25 18:52:20,823 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 18:52:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2038087948, now seen corresponding path program 11 times [2021-11-25 18:52:20,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:20,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444917410] [2021-11-25 18:52:20,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:20,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:21,224 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 18:52:21,224 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:21,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444917410] [2021-11-25 18:52:21,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444917410] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:21,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:21,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:52:21,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014217084] [2021-11-25 18:52:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:21,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:52:21,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:52:21,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:52:21,226 INFO L87 Difference]: Start difference. First operand 1672 states and 3717 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 18:52:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:22,694 INFO L93 Difference]: Finished difference Result 2273 states and 5016 transitions. [2021-11-25 18:52:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:52:22,695 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 18:52:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:22,697 INFO L225 Difference]: With dead ends: 2273 [2021-11-25 18:52:22,697 INFO L226 Difference]: Without dead ends: 2273 [2021-11-25 18:52:22,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:52:22,698 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 334 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:22,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 29 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 18:52:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2021-11-25 18:52:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1674. [2021-11-25 18:52:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1664 states have (on average 2.2373798076923075) internal successors, (3723), 1673 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 3723 transitions. [2021-11-25 18:52:22,731 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 3723 transitions. Word has length 15 [2021-11-25 18:52:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:22,731 INFO L470 AbstractCegarLoop]: Abstraction has 1674 states and 3723 transitions. [2021-11-25 18:52:22,732 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 18:52:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 3723 transitions. [2021-11-25 18:52:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:52:22,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:22,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:52:22,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-25 18:52:22,733 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 18:52:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:22,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1715211040, now seen corresponding path program 12 times [2021-11-25 18:52:22,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:22,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370178897] [2021-11-25 18:52:22,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:22,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:23,015 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 18:52:23,015 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:23,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370178897] [2021-11-25 18:52:23,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370178897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:23,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:23,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:52:23,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969665930] [2021-11-25 18:52:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:23,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:52:23,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:23,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:52:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:52:23,017 INFO L87 Difference]: Start difference. First operand 1674 states and 3723 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 18:52:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:25,538 INFO L93 Difference]: Finished difference Result 2331 states and 5143 transitions. [2021-11-25 18:52:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 18:52:25,538 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 18:52:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:25,541 INFO L225 Difference]: With dead ends: 2331 [2021-11-25 18:52:25,541 INFO L226 Difference]: Without dead ends: 2331 [2021-11-25 18:52:25,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:52:25,542 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 515 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:25,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 37 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 18:52:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2021-11-25 18:52:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 1630. [2021-11-25 18:52:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1620 states have (on average 2.2302469135802467) internal successors, (3613), 1629 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 3613 transitions. [2021-11-25 18:52:25,573 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 3613 transitions. Word has length 15 [2021-11-25 18:52:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:25,574 INFO L470 AbstractCegarLoop]: Abstraction has 1630 states and 3613 transitions. [2021-11-25 18:52:25,574 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 18:52:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 3613 transitions. [2021-11-25 18:52:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:52:25,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:25,575 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 18:52:25,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-25 18:52:25,575 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 18:52:25,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1832548229, now seen corresponding path program 1 times [2021-11-25 18:52:25,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:25,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033021624] [2021-11-25 18:52:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:25,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:26,353 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 18:52:26,353 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:26,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033021624] [2021-11-25 18:52:26,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033021624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:26,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:26,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:52:26,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356946008] [2021-11-25 18:52:26,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:26,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:52:26,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:52:26,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:52:26,355 INFO L87 Difference]: Start difference. First operand 1630 states and 3613 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 18:52:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:30,690 INFO L93 Difference]: Finished difference Result 2681 states and 5967 transitions. [2021-11-25 18:52:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 18:52:30,690 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 18:52:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:30,693 INFO L225 Difference]: With dead ends: 2681 [2021-11-25 18:52:30,693 INFO L226 Difference]: Without dead ends: 2681 [2021-11-25 18:52:30,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:52:30,694 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 507 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 3981 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:30,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 49 Invalid, 4046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3981 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-11-25 18:52:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2021-11-25 18:52:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 1746. [2021-11-25 18:52:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1736 states have (on average 2.244815668202765) internal successors, (3897), 1745 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 3897 transitions. [2021-11-25 18:52:30,729 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 3897 transitions. Word has length 17 [2021-11-25 18:52:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:30,729 INFO L470 AbstractCegarLoop]: Abstraction has 1746 states and 3897 transitions. [2021-11-25 18:52:30,730 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 18:52:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 3897 transitions. [2021-11-25 18:52:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:52:30,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:30,731 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 18:52:30,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-25 18:52:30,732 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 18:52:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1839784559, now seen corresponding path program 2 times [2021-11-25 18:52:30,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:30,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995755284] [2021-11-25 18:52:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:30,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:31,331 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 18:52:31,331 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:31,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995755284] [2021-11-25 18:52:31,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995755284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:31,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:31,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:52:31,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257710320] [2021-11-25 18:52:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:31,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:52:31,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:52:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:52:31,333 INFO L87 Difference]: Start difference. First operand 1746 states and 3897 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 18:52:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:34,692 INFO L93 Difference]: Finished difference Result 3057 states and 6853 transitions. [2021-11-25 18:52:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 18:52:34,692 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 18:52:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:34,695 INFO L225 Difference]: With dead ends: 3057 [2021-11-25 18:52:34,696 INFO L226 Difference]: Without dead ends: 3057 [2021-11-25 18:52:34,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:52:34,697 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 593 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 3002 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:34,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 33 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3002 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 18:52:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2021-11-25 18:52:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 1758. [2021-11-25 18:52:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1748 states have (on average 2.2511441647597255) internal successors, (3935), 1757 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 3935 transitions. [2021-11-25 18:52:34,740 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 3935 transitions. Word has length 17 [2021-11-25 18:52:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:34,740 INFO L470 AbstractCegarLoop]: Abstraction has 1758 states and 3935 transitions. [2021-11-25 18:52:34,740 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 18:52:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3935 transitions. [2021-11-25 18:52:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:52:34,742 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:34,742 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 18:52:34,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-25 18:52:34,742 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 18:52:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash -73597283, now seen corresponding path program 3 times [2021-11-25 18:52:34,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:34,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678929348] [2021-11-25 18:52:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:34,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:35,540 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 18:52:35,540 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:35,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678929348] [2021-11-25 18:52:35,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678929348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:35,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:35,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:52:35,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960046892] [2021-11-25 18:52:35,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:35,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:52:35,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:52:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:52:35,542 INFO L87 Difference]: Start difference. First operand 1758 states and 3935 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 18:52:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:40,754 INFO L93 Difference]: Finished difference Result 3166 states and 7087 transitions. [2021-11-25 18:52:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 18:52:40,754 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 18:52:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:40,758 INFO L225 Difference]: With dead ends: 3166 [2021-11-25 18:52:40,758 INFO L226 Difference]: Without dead ends: 3166 [2021-11-25 18:52:40,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=446, Invalid=1446, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:52:40,759 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 686 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:40,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [686 Valid, 33 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 18:52:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2021-11-25 18:52:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 1760. [2021-11-25 18:52:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1750 states have (on average 2.252) internal successors, (3941), 1759 states have internal predecessors, (3941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 3941 transitions. [2021-11-25 18:52:40,813 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 3941 transitions. Word has length 17 [2021-11-25 18:52:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:40,813 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 3941 transitions. [2021-11-25 18:52:40,813 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 18:52:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3941 transitions. [2021-11-25 18:52:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:52:40,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:40,815 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 18:52:40,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-25 18:52:40,815 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 18:52:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash -80833613, now seen corresponding path program 4 times [2021-11-25 18:52:40,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:40,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981865652] [2021-11-25 18:52:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:40,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:41,302 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 18:52:41,302 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:41,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981865652] [2021-11-25 18:52:41,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981865652] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:41,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:41,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:52:41,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8479086] [2021-11-25 18:52:41,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:41,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:52:41,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:41,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:52:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:52:41,304 INFO L87 Difference]: Start difference. First operand 1760 states and 3941 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 18:52:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:44,436 INFO L93 Difference]: Finished difference Result 3247 states and 7302 transitions. [2021-11-25 18:52:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 18:52:44,436 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 18:52:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:44,441 INFO L225 Difference]: With dead ends: 3247 [2021-11-25 18:52:44,441 INFO L226 Difference]: Without dead ends: 3247 [2021-11-25 18:52:44,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:52:44,443 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 692 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:44,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 39 Invalid, 2727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:52:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2021-11-25 18:52:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 1769. [2021-11-25 18:52:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1759 states have (on average 2.251847640704946) internal successors, (3961), 1768 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 3961 transitions. [2021-11-25 18:52:44,485 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 3961 transitions. Word has length 17 [2021-11-25 18:52:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:44,485 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 3961 transitions. [2021-11-25 18:52:44,485 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 18:52:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3961 transitions. [2021-11-25 18:52:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:52:44,487 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:44,487 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 18:52:44,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-25 18:52:44,487 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 18:52:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:44,488 INFO L85 PathProgramCache]: Analyzing trace with hash 314281537, now seen corresponding path program 5 times [2021-11-25 18:52:44,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:44,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120733879] [2021-11-25 18:52:44,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:44,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:44,963 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 18:52:44,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120733879] [2021-11-25 18:52:44,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120733879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:44,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:44,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:52:44,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191991528] [2021-11-25 18:52:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:44,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:52:44,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:52:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:52:44,966 INFO L87 Difference]: Start difference. First operand 1769 states and 3961 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 18:52:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:49,103 INFO L93 Difference]: Finished difference Result 2933 states and 6571 transitions. [2021-11-25 18:52:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 18:52:49,103 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 18:52:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:49,106 INFO L225 Difference]: With dead ends: 2933 [2021-11-25 18:52:49,106 INFO L226 Difference]: Without dead ends: 2933 [2021-11-25 18:52:49,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:52:49,108 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 572 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 4326 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 4326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:49,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 49 Invalid, 4388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 4326 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-11-25 18:52:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2021-11-25 18:52:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1766. [2021-11-25 18:52:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1756 states have (on average 2.2517084282460136) internal successors, (3954), 1765 states have internal predecessors, (3954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 3954 transitions. [2021-11-25 18:52:49,145 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 3954 transitions. Word has length 17 [2021-11-25 18:52:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:49,145 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 3954 transitions. [2021-11-25 18:52:49,145 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 18:52:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 3954 transitions. [2021-11-25 18:52:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:52:49,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:49,147 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 18:52:49,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-25 18:52:49,147 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 18:52:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1401229925, now seen corresponding path program 6 times [2021-11-25 18:52:49,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:49,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71128893] [2021-11-25 18:52:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:49,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:49,794 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 18:52:49,795 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:49,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71128893] [2021-11-25 18:52:49,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71128893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:49,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:49,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:52:49,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448703627] [2021-11-25 18:52:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:49,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:52:49,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:49,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:52:49,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:52:49,796 INFO L87 Difference]: Start difference. First operand 1766 states and 3954 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 18:52:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:52:54,623 INFO L93 Difference]: Finished difference Result 3341 states and 7519 transitions. [2021-11-25 18:52:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 18:52:54,632 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 18:52:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:52:54,638 INFO L225 Difference]: With dead ends: 3341 [2021-11-25 18:52:54,638 INFO L226 Difference]: Without dead ends: 3341 [2021-11-25 18:52:54,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=406, Invalid=1574, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:52:54,639 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 656 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 4309 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 4309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:52:54,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 51 Invalid, 4377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 4309 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-25 18:52:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2021-11-25 18:52:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 1774. [2021-11-25 18:52:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1764 states have (on average 2.251700680272109) internal successors, (3972), 1773 states have internal predecessors, (3972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:52:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 3972 transitions. [2021-11-25 18:52:54,683 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 3972 transitions. Word has length 17 [2021-11-25 18:52:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:52:54,683 INFO L470 AbstractCegarLoop]: Abstraction has 1774 states and 3972 transitions. [2021-11-25 18:52:54,683 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 18:52:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3972 transitions. [2021-11-25 18:52:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:52:54,685 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:52:54,685 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 18:52:54,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-25 18:52:54,686 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 18:52:54,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:52:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1796345075, now seen corresponding path program 7 times [2021-11-25 18:52:54,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:52:54,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486305515] [2021-11-25 18:52:54,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:52:54,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:52:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:52:55,498 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 18:52:55,498 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:52:55,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486305515] [2021-11-25 18:52:55,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486305515] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:52:55,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:52:55,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:52:55,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336022654] [2021-11-25 18:52:55,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:52:55,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:52:55,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:52:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:52:55,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:52:55,500 INFO L87 Difference]: Start difference. First operand 1774 states and 3972 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 18:53:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:00,969 INFO L93 Difference]: Finished difference Result 3020 states and 6761 transitions. [2021-11-25 18:53:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 18:53:00,969 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 18:53:00,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:00,972 INFO L225 Difference]: With dead ends: 3020 [2021-11-25 18:53:00,972 INFO L226 Difference]: Without dead ends: 3020 [2021-11-25 18:53:00,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=397, Invalid=1495, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:53:00,974 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 707 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 3150 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:00,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [707 Valid, 45 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3150 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 18:53:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2021-11-25 18:53:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 1781. [2021-11-25 18:53:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1771 states have (on average 2.251270468661773) internal successors, (3987), 1780 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 3987 transitions. [2021-11-25 18:53:01,012 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 3987 transitions. Word has length 17 [2021-11-25 18:53:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:01,012 INFO L470 AbstractCegarLoop]: Abstraction has 1781 states and 3987 transitions. [2021-11-25 18:53:01,012 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 18:53:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3987 transitions. [2021-11-25 18:53:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:01,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:01,014 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 18:53:01,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-25 18:53:01,014 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 18:53:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1111665965, now seen corresponding path program 8 times [2021-11-25 18:53:01,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:01,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536754360] [2021-11-25 18:53:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:01,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:01,356 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 18:53:01,356 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:01,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536754360] [2021-11-25 18:53:01,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536754360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:01,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:01,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:53:01,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625495809] [2021-11-25 18:53:01,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:01,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:53:01,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:01,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:53:01,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:53:01,358 INFO L87 Difference]: Start difference. First operand 1781 states and 3987 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 18:53:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:04,618 INFO L93 Difference]: Finished difference Result 3096 states and 6959 transitions. [2021-11-25 18:53:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:53:04,619 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 18:53:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:04,622 INFO L225 Difference]: With dead ends: 3096 [2021-11-25 18:53:04,623 INFO L226 Difference]: Without dead ends: 3096 [2021-11-25 18:53:04,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=341, Invalid=1141, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:53:04,623 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 811 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:04,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [811 Valid, 43 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3229 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 18:53:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2021-11-25 18:53:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 1767. [2021-11-25 18:53:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1757 states have (on average 2.244166192373364) internal successors, (3943), 1766 states have internal predecessors, (3943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 3943 transitions. [2021-11-25 18:53:04,676 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 3943 transitions. Word has length 17 [2021-11-25 18:53:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:04,676 INFO L470 AbstractCegarLoop]: Abstraction has 1767 states and 3943 transitions. [2021-11-25 18:53:04,676 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 18:53:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3943 transitions. [2021-11-25 18:53:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:04,678 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:04,678 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 18:53:04,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-25 18:53:04,678 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 18:53:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash -544143271, now seen corresponding path program 9 times [2021-11-25 18:53:04,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:04,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137088830] [2021-11-25 18:53:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:04,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:05,190 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 18:53:05,191 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:05,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137088830] [2021-11-25 18:53:05,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137088830] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:05,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:05,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:53:05,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622644638] [2021-11-25 18:53:05,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:05,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:53:05,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:05,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:53:05,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:53:05,193 INFO L87 Difference]: Start difference. First operand 1767 states and 3943 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 18:53:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:08,738 INFO L93 Difference]: Finished difference Result 3176 states and 7136 transitions. [2021-11-25 18:53:08,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 18:53:08,739 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 18:53:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:08,743 INFO L225 Difference]: With dead ends: 3176 [2021-11-25 18:53:08,743 INFO L226 Difference]: Without dead ends: 3176 [2021-11-25 18:53:08,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=417, Invalid=1653, Unknown=0, NotChecked=0, Total=2070 [2021-11-25 18:53:08,744 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 604 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 3065 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:08,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [604 Valid, 39 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3065 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:53:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2021-11-25 18:53:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 1789. [2021-11-25 18:53:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1779 states have (on average 2.2507026419336706) internal successors, (4004), 1788 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 4004 transitions. [2021-11-25 18:53:08,786 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 4004 transitions. Word has length 17 [2021-11-25 18:53:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:08,786 INFO L470 AbstractCegarLoop]: Abstraction has 1789 states and 4004 transitions. [2021-11-25 18:53:08,786 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 18:53:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 4004 transitions. [2021-11-25 18:53:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:08,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:08,788 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 18:53:08,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-25 18:53:08,788 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 18:53:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:08,789 INFO L85 PathProgramCache]: Analyzing trace with hash -149028121, now seen corresponding path program 10 times [2021-11-25 18:53:08,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:08,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242320149] [2021-11-25 18:53:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:08,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:09,278 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 18:53:09,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:09,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242320149] [2021-11-25 18:53:09,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242320149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:09,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:09,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:53:09,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010999893] [2021-11-25 18:53:09,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:09,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:53:09,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:09,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:53:09,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:53:09,281 INFO L87 Difference]: Start difference. First operand 1789 states and 4004 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 18:53:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:12,954 INFO L93 Difference]: Finished difference Result 2785 states and 6238 transitions. [2021-11-25 18:53:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 18:53:12,955 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 18:53:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:12,958 INFO L225 Difference]: With dead ends: 2785 [2021-11-25 18:53:12,958 INFO L226 Difference]: Without dead ends: 2785 [2021-11-25 18:53:12,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=377, Invalid=1345, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 18:53:12,959 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 652 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 3452 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:12,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [652 Valid, 41 Invalid, 3526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3452 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:53:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2021-11-25 18:53:13,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 1789. [2021-11-25 18:53:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1779 states have (on average 2.2507026419336706) internal successors, (4004), 1788 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 4004 transitions. [2021-11-25 18:53:13,007 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 4004 transitions. Word has length 17 [2021-11-25 18:53:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:13,008 INFO L470 AbstractCegarLoop]: Abstraction has 1789 states and 4004 transitions. [2021-11-25 18:53:13,008 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 18:53:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 4004 transitions. [2021-11-25 18:53:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:13,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:13,009 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 18:53:13,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-25 18:53:13,009 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 18:53:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 937920267, now seen corresponding path program 11 times [2021-11-25 18:53:13,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:13,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648797879] [2021-11-25 18:53:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:13,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:13,957 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 18:53:13,957 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:13,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648797879] [2021-11-25 18:53:13,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648797879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:13,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:13,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:53:13,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055257732] [2021-11-25 18:53:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:13,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:53:13,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:13,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:53:13,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:53:13,959 INFO L87 Difference]: Start difference. First operand 1789 states and 4004 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 18:53:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:19,199 INFO L93 Difference]: Finished difference Result 3510 states and 7926 transitions. [2021-11-25 18:53:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:53:19,200 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 18:53:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:19,204 INFO L225 Difference]: With dead ends: 3510 [2021-11-25 18:53:19,204 INFO L226 Difference]: Without dead ends: 3510 [2021-11-25 18:53:19,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=361, Invalid=1199, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:53:19,205 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 655 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3370 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:19,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 45 Invalid, 3438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3370 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-25 18:53:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2021-11-25 18:53:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 1787. [2021-11-25 18:53:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1777 states have (on average 2.2504220596510973) internal successors, (3999), 1786 states have internal predecessors, (3999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 3999 transitions. [2021-11-25 18:53:19,232 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 3999 transitions. Word has length 17 [2021-11-25 18:53:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:19,233 INFO L470 AbstractCegarLoop]: Abstraction has 1787 states and 3999 transitions. [2021-11-25 18:53:19,233 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 18:53:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 3999 transitions. [2021-11-25 18:53:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:19,235 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:19,235 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 18:53:19,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-25 18:53:19,236 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 18:53:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1574975623, now seen corresponding path program 12 times [2021-11-25 18:53:19,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:19,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260265181] [2021-11-25 18:53:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:19,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:19,601 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 18:53:19,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:19,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260265181] [2021-11-25 18:53:19,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260265181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:19,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:19,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:53:19,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445848564] [2021-11-25 18:53:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:19,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:53:19,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:19,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:53:19,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:53:19,603 INFO L87 Difference]: Start difference. First operand 1787 states and 3999 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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 18:53:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:22,283 INFO L93 Difference]: Finished difference Result 2202 states and 4891 transitions. [2021-11-25 18:53:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 18:53:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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 18:53:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:22,286 INFO L225 Difference]: With dead ends: 2202 [2021-11-25 18:53:22,286 INFO L226 Difference]: Without dead ends: 2202 [2021-11-25 18:53:22,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2021-11-25 18:53:22,287 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 461 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:22,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 26 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 18:53:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2021-11-25 18:53:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1830. [2021-11-25 18:53:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1820 states have (on average 2.2483516483516484) internal successors, (4092), 1829 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 4092 transitions. [2021-11-25 18:53:22,310 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 4092 transitions. Word has length 17 [2021-11-25 18:53:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:22,310 INFO L470 AbstractCegarLoop]: Abstraction has 1830 states and 4092 transitions. [2021-11-25 18:53:22,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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 18:53:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 4092 transitions. [2021-11-25 18:53:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:22,312 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:22,312 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 18:53:22,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-25 18:53:22,313 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:53:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1582211953, now seen corresponding path program 13 times [2021-11-25 18:53:22,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:22,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9092849] [2021-11-25 18:53:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:22,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:22,607 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 18:53:22,607 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:22,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9092849] [2021-11-25 18:53:22,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9092849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:22,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:22,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:53:22,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938471352] [2021-11-25 18:53:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:22,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:53:22,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:22,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:53:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:53:22,609 INFO L87 Difference]: Start difference. First operand 1830 states and 4092 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 18:53:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:26,222 INFO L93 Difference]: Finished difference Result 2976 states and 6693 transitions. [2021-11-25 18:53:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:53:26,223 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 18:53:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:26,226 INFO L225 Difference]: With dead ends: 2976 [2021-11-25 18:53:26,226 INFO L226 Difference]: Without dead ends: 2976 [2021-11-25 18:53:26,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=378, Invalid=1262, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 18:53:26,227 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 604 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 4178 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:26,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [604 Valid, 47 Invalid, 4224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4178 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 18:53:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2021-11-25 18:53:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1816. [2021-11-25 18:53:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1806 states have (on average 2.249169435215947) internal successors, (4062), 1815 states have internal predecessors, (4062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 4062 transitions. [2021-11-25 18:53:26,266 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 4062 transitions. Word has length 17 [2021-11-25 18:53:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:26,266 INFO L470 AbstractCegarLoop]: Abstraction has 1816 states and 4062 transitions. [2021-11-25 18:53:26,266 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 18:53:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 4062 transitions. [2021-11-25 18:53:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:26,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:26,267 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 18:53:26,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-25 18:53:26,268 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 18:53:26,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1500435709, now seen corresponding path program 14 times [2021-11-25 18:53:26,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:26,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410946544] [2021-11-25 18:53:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:26,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:26,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 18:53:26,591 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:26,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410946544] [2021-11-25 18:53:26,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410946544] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:26,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:26,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:53:26,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245883381] [2021-11-25 18:53:26,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:26,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:53:26,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:26,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:53:26,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:53:26,593 INFO L87 Difference]: Start difference. First operand 1816 states and 4062 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 18:53:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:30,176 INFO L93 Difference]: Finished difference Result 2899 states and 6493 transitions. [2021-11-25 18:53:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 18:53:30,176 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 18:53:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:30,179 INFO L225 Difference]: With dead ends: 2899 [2021-11-25 18:53:30,179 INFO L226 Difference]: Without dead ends: 2899 [2021-11-25 18:53:30,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:53:30,180 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 611 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 4088 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:30,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 49 Invalid, 4136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4088 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 18:53:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2021-11-25 18:53:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1826. [2021-11-25 18:53:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1816 states have (on average 2.248898678414097) internal successors, (4084), 1825 states have internal predecessors, (4084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 4084 transitions. [2021-11-25 18:53:30,203 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 4084 transitions. Word has length 17 [2021-11-25 18:53:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:30,203 INFO L470 AbstractCegarLoop]: Abstraction has 1826 states and 4084 transitions. [2021-11-25 18:53:30,203 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 18:53:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 4084 transitions. [2021-11-25 18:53:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:30,204 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:30,204 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 18:53:30,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-25 18:53:30,205 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 18:53:30,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash 953406993, now seen corresponding path program 15 times [2021-11-25 18:53:30,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:30,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282175078] [2021-11-25 18:53:30,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:30,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:30,839 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 18:53:30,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:30,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282175078] [2021-11-25 18:53:30,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282175078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:30,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:30,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:53:30,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963287427] [2021-11-25 18:53:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:30,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:53:30,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:30,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:53:30,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:53:30,841 INFO L87 Difference]: Start difference. First operand 1826 states and 4084 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 18:53:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:35,551 INFO L93 Difference]: Finished difference Result 3045 states and 6844 transitions. [2021-11-25 18:53:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 18:53:35,551 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 18:53:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:35,554 INFO L225 Difference]: With dead ends: 3045 [2021-11-25 18:53:35,554 INFO L226 Difference]: Without dead ends: 3045 [2021-11-25 18:53:35,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:53:35,555 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 693 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 3680 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:35,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 41 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3680 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-25 18:53:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2021-11-25 18:53:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 1835. [2021-11-25 18:53:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1825 states have (on average 2.24986301369863) internal successors, (4106), 1834 states have internal predecessors, (4106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 4106 transitions. [2021-11-25 18:53:35,579 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 4106 transitions. Word has length 17 [2021-11-25 18:53:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:35,580 INFO L470 AbstractCegarLoop]: Abstraction has 1835 states and 4106 transitions. [2021-11-25 18:53:35,580 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 18:53:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 4106 transitions. [2021-11-25 18:53:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:35,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:35,581 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 18:53:35,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-25 18:53:35,581 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 18:53:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:35,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1348522143, now seen corresponding path program 16 times [2021-11-25 18:53:35,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:35,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173375078] [2021-11-25 18:53:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:35,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:36,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 18:53:36,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:36,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173375078] [2021-11-25 18:53:36,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173375078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:36,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:36,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:53:36,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144420789] [2021-11-25 18:53:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:36,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:53:36,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:53:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:53:36,030 INFO L87 Difference]: Start difference. First operand 1835 states and 4106 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 18:53:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:40,068 INFO L93 Difference]: Finished difference Result 2831 states and 6368 transitions. [2021-11-25 18:53:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 18:53:40,068 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 18:53:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:40,072 INFO L225 Difference]: With dead ends: 2831 [2021-11-25 18:53:40,072 INFO L226 Difference]: Without dead ends: 2831 [2021-11-25 18:53:40,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=398, Invalid=1494, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:53:40,073 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 644 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3550 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:40,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [644 Valid, 45 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3550 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 18:53:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2021-11-25 18:53:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 1819. [2021-11-25 18:53:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1809 states have (on average 2.2493090105030404) internal successors, (4069), 1818 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:40,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 4069 transitions. [2021-11-25 18:53:40,113 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 4069 transitions. Word has length 17 [2021-11-25 18:53:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:40,113 INFO L470 AbstractCegarLoop]: Abstraction has 1819 states and 4069 transitions. [2021-11-25 18:53:40,113 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 18:53:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 4069 transitions. [2021-11-25 18:53:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:40,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:40,114 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 18:53:40,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-25 18:53:40,115 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 18:53:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1559488897, now seen corresponding path program 17 times [2021-11-25 18:53:40,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:40,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611623591] [2021-11-25 18:53:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:40,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:40,440 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 18:53:40,440 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:40,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611623591] [2021-11-25 18:53:40,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611623591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:40,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:40,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:53:40,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510009339] [2021-11-25 18:53:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:40,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:53:40,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:53:40,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:53:40,442 INFO L87 Difference]: Start difference. First operand 1819 states and 4069 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 18:53:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:43,947 INFO L93 Difference]: Finished difference Result 2799 states and 6286 transitions. [2021-11-25 18:53:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:53:43,948 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 18:53:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:43,951 INFO L225 Difference]: With dead ends: 2799 [2021-11-25 18:53:43,951 INFO L226 Difference]: Without dead ends: 2799 [2021-11-25 18:53:43,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 18:53:43,952 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 608 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 3976 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:43,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [608 Valid, 47 Invalid, 4025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3976 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:53:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2021-11-25 18:53:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 1819. [2021-11-25 18:53:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1809 states have (on average 2.2493090105030404) internal successors, (4069), 1818 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 4069 transitions. [2021-11-25 18:53:43,975 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 4069 transitions. Word has length 17 [2021-11-25 18:53:43,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:43,976 INFO L470 AbstractCegarLoop]: Abstraction has 1819 states and 4069 transitions. [2021-11-25 18:53:43,976 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 18:53:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 4069 transitions. [2021-11-25 18:53:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:43,977 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:43,978 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 18:53:43,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-25 18:53:43,978 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 18:53:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1734936525, now seen corresponding path program 18 times [2021-11-25 18:53:43,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:43,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854780597] [2021-11-25 18:53:43,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:43,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:44,545 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 18:53:44,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:44,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854780597] [2021-11-25 18:53:44,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854780597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:44,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:44,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:53:44,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368430032] [2021-11-25 18:53:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:44,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:53:44,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:53:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:53:44,547 INFO L87 Difference]: Start difference. First operand 1819 states and 4069 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 18:53:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:47,577 INFO L93 Difference]: Finished difference Result 3504 states and 7849 transitions. [2021-11-25 18:53:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 18:53:47,578 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 18:53:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:47,582 INFO L225 Difference]: With dead ends: 3504 [2021-11-25 18:53:47,582 INFO L226 Difference]: Without dead ends: 3504 [2021-11-25 18:53:47,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:53:47,583 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 413 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 3131 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:47,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 29 Invalid, 3164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3131 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 18:53:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2021-11-25 18:53:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 1832. [2021-11-25 18:53:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1822 states have (on average 2.253018660812294) internal successors, (4105), 1831 states have internal predecessors, (4105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4105 transitions. [2021-11-25 18:53:47,609 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4105 transitions. Word has length 17 [2021-11-25 18:53:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:47,609 INFO L470 AbstractCegarLoop]: Abstraction has 1832 states and 4105 transitions. [2021-11-25 18:53:47,609 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 18:53:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4105 transitions. [2021-11-25 18:53:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:47,610 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:47,610 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 18:53:47,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-25 18:53:47,611 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 18:53:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2130051675, now seen corresponding path program 19 times [2021-11-25 18:53:47,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:47,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660351073] [2021-11-25 18:53:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:47,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:48,116 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 18:53:48,116 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:48,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660351073] [2021-11-25 18:53:48,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660351073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:48,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:48,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:53:48,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376846236] [2021-11-25 18:53:48,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:48,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:53:48,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:48,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:53:48,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:53:48,118 INFO L87 Difference]: Start difference. First operand 1832 states and 4105 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 18:53:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:51,159 INFO L93 Difference]: Finished difference Result 3205 states and 7176 transitions. [2021-11-25 18:53:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 18:53:51,160 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 18:53:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:51,163 INFO L225 Difference]: With dead ends: 3205 [2021-11-25 18:53:51,163 INFO L226 Difference]: Without dead ends: 3205 [2021-11-25 18:53:51,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 18:53:51,165 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 515 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:51,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 43 Invalid, 3099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:53:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2021-11-25 18:53:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 1830. [2021-11-25 18:53:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1820 states have (on average 2.2527472527472527) internal successors, (4100), 1829 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 4100 transitions. [2021-11-25 18:53:51,191 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 4100 transitions. Word has length 17 [2021-11-25 18:53:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:51,192 INFO L470 AbstractCegarLoop]: Abstraction has 1830 states and 4100 transitions. [2021-11-25 18:53:51,192 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 18:53:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 4100 transitions. [2021-11-25 18:53:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:51,193 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:51,194 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 18:53:51,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-25 18:53:51,194 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 18:53:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash -36660035, now seen corresponding path program 20 times [2021-11-25 18:53:51,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:51,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222913702] [2021-11-25 18:53:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:51,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:51,790 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 18:53:51,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222913702] [2021-11-25 18:53:51,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222913702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:51,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:51,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:53:51,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939579092] [2021-11-25 18:53:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:51,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:53:51,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:53:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:53:51,791 INFO L87 Difference]: Start difference. First operand 1830 states and 4100 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 18:53:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:54,920 INFO L93 Difference]: Finished difference Result 3555 states and 7975 transitions. [2021-11-25 18:53:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 18:53:54,920 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 18:53:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:54,924 INFO L225 Difference]: With dead ends: 3555 [2021-11-25 18:53:54,924 INFO L226 Difference]: Without dead ends: 3555 [2021-11-25 18:53:54,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=314, Invalid=1092, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:53:54,925 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 564 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:54,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 37 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:53:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2021-11-25 18:53:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 1854. [2021-11-25 18:53:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1844 states have (on average 2.2554229934924077) internal successors, (4159), 1853 states have internal predecessors, (4159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 4159 transitions. [2021-11-25 18:53:54,972 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 4159 transitions. Word has length 17 [2021-11-25 18:53:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:54,972 INFO L470 AbstractCegarLoop]: Abstraction has 1854 states and 4159 transitions. [2021-11-25 18:53:54,972 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 18:53:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 4159 transitions. [2021-11-25 18:53:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:54,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:54,973 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 18:53:54,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-25 18:53:54,973 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 18:53:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash 358455115, now seen corresponding path program 21 times [2021-11-25 18:53:54,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:54,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830522421] [2021-11-25 18:53:54,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:54,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:55,540 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 18:53:55,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:55,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830522421] [2021-11-25 18:53:55,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830522421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:55,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:55,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:53:55,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697785552] [2021-11-25 18:53:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:55,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:53:55,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:55,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:53:55,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:53:55,542 INFO L87 Difference]: Start difference. First operand 1854 states and 4159 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 18:53:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:53:59,345 INFO L93 Difference]: Finished difference Result 3846 states and 8636 transitions. [2021-11-25 18:53:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 18:53:59,352 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 18:53:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:53:59,357 INFO L225 Difference]: With dead ends: 3846 [2021-11-25 18:53:59,357 INFO L226 Difference]: Without dead ends: 3846 [2021-11-25 18:53:59,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=466, Invalid=1514, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:53:59,358 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 797 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 3285 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:53:59,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [797 Valid, 45 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3285 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 18:53:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2021-11-25 18:53:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 1848. [2021-11-25 18:53:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1838 states have (on average 2.2551686615886832) internal successors, (4145), 1847 states have internal predecessors, (4145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:53:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 4145 transitions. [2021-11-25 18:53:59,387 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 4145 transitions. Word has length 17 [2021-11-25 18:53:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:53:59,388 INFO L470 AbstractCegarLoop]: Abstraction has 1848 states and 4145 transitions. [2021-11-25 18:53:59,388 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 18:53:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 4145 transitions. [2021-11-25 18:53:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:53:59,389 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:53:59,390 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 18:53:59,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-25 18:53:59,390 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 18:53:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:53:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1722290911, now seen corresponding path program 22 times [2021-11-25 18:53:59,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:53:59,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212944339] [2021-11-25 18:53:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:53:59,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:53:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:53:59,985 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 18:53:59,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:53:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212944339] [2021-11-25 18:53:59,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212944339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:53:59,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:53:59,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:53:59,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785167306] [2021-11-25 18:53:59,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:53:59,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:53:59,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:53:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:53:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:53:59,986 INFO L87 Difference]: Start difference. First operand 1848 states and 4145 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 18:54:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:03,423 INFO L93 Difference]: Finished difference Result 3751 states and 8434 transitions. [2021-11-25 18:54:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 18:54:03,423 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 18:54:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:03,428 INFO L225 Difference]: With dead ends: 3751 [2021-11-25 18:54:03,428 INFO L226 Difference]: Without dead ends: 3751 [2021-11-25 18:54:03,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=321, Invalid=1085, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:54:03,429 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 699 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 3248 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:03,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 41 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3248 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:54:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2021-11-25 18:54:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 1857. [2021-11-25 18:54:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1847 states have (on average 2.2550081212777475) internal successors, (4165), 1856 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 4165 transitions. [2021-11-25 18:54:03,471 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 4165 transitions. Word has length 17 [2021-11-25 18:54:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:03,471 INFO L470 AbstractCegarLoop]: Abstraction has 1857 states and 4165 transitions. [2021-11-25 18:54:03,471 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 18:54:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 4165 transitions. [2021-11-25 18:54:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:03,472 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:03,472 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 18:54:03,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-25 18:54:03,473 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 18:54:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2117406061, now seen corresponding path program 23 times [2021-11-25 18:54:03,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:03,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882246379] [2021-11-25 18:54:03,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:03,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:03,962 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 18:54:03,962 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:03,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882246379] [2021-11-25 18:54:03,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882246379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:03,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:03,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:54:03,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195016580] [2021-11-25 18:54:03,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:03,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:54:03,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:03,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:54:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:54:03,963 INFO L87 Difference]: Start difference. First operand 1857 states and 4165 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 18:54:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:07,486 INFO L93 Difference]: Finished difference Result 3359 states and 7510 transitions. [2021-11-25 18:54:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:54:07,486 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 18:54:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:07,490 INFO L225 Difference]: With dead ends: 3359 [2021-11-25 18:54:07,490 INFO L226 Difference]: Without dead ends: 3359 [2021-11-25 18:54:07,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=349, Invalid=1133, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:54:07,491 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 631 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 3565 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:07,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 45 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3565 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:54:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2021-11-25 18:54:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 1854. [2021-11-25 18:54:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1844 states have (on average 2.254880694143167) internal successors, (4158), 1853 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 4158 transitions. [2021-11-25 18:54:07,517 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 4158 transitions. Word has length 17 [2021-11-25 18:54:07,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:07,517 INFO L470 AbstractCegarLoop]: Abstraction has 1854 states and 4158 transitions. [2021-11-25 18:54:07,517 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 18:54:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 4158 transitions. [2021-11-25 18:54:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:07,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:07,518 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 18:54:07,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-25 18:54:07,519 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 18:54:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash 691458559, now seen corresponding path program 24 times [2021-11-25 18:54:07,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:07,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119895605] [2021-11-25 18:54:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:07,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:07,850 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 18:54:07,851 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:07,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119895605] [2021-11-25 18:54:07,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119895605] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:07,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:07,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:54:07,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927904086] [2021-11-25 18:54:07,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:07,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:54:07,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:07,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:54:07,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:54:07,852 INFO L87 Difference]: Start difference. First operand 1854 states and 4158 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 18:54:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:10,862 INFO L93 Difference]: Finished difference Result 3533 states and 7941 transitions. [2021-11-25 18:54:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 18:54:10,862 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 18:54:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:10,866 INFO L225 Difference]: With dead ends: 3533 [2021-11-25 18:54:10,866 INFO L226 Difference]: Without dead ends: 3533 [2021-11-25 18:54:10,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=350, Invalid=1056, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:54:10,867 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 828 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 3045 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:10,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [828 Valid, 41 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3045 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:54:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2021-11-25 18:54:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 1826. [2021-11-25 18:54:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1816 states have (on average 2.2527533039647576) internal successors, (4091), 1825 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 4091 transitions. [2021-11-25 18:54:10,892 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 4091 transitions. Word has length 17 [2021-11-25 18:54:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:10,892 INFO L470 AbstractCegarLoop]: Abstraction has 1826 states and 4091 transitions. [2021-11-25 18:54:10,892 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 18:54:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 4091 transitions. [2021-11-25 18:54:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:10,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:10,893 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 18:54:10,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-25 18:54:10,894 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 18:54:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -305504299, now seen corresponding path program 25 times [2021-11-25 18:54:10,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:10,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287284964] [2021-11-25 18:54:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:10,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:11,540 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 18:54:11,540 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287284964] [2021-11-25 18:54:11,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287284964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:11,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:11,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:54:11,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50649228] [2021-11-25 18:54:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:11,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:54:11,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:54:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:54:11,542 INFO L87 Difference]: Start difference. First operand 1826 states and 4091 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 18:54:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:14,252 INFO L93 Difference]: Finished difference Result 3220 states and 7224 transitions. [2021-11-25 18:54:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 18:54:14,253 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 18:54:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:14,256 INFO L225 Difference]: With dead ends: 3220 [2021-11-25 18:54:14,256 INFO L226 Difference]: Without dead ends: 3220 [2021-11-25 18:54:14,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:54:14,257 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 342 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:14,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 35 Invalid, 3069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:54:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2021-11-25 18:54:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 1833. [2021-11-25 18:54:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1823 states have (on average 2.2534284147010424) internal successors, (4108), 1832 states have internal predecessors, (4108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 4108 transitions. [2021-11-25 18:54:14,281 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 4108 transitions. Word has length 17 [2021-11-25 18:54:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:14,281 INFO L470 AbstractCegarLoop]: Abstraction has 1833 states and 4108 transitions. [2021-11-25 18:54:14,281 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 18:54:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 4108 transitions. [2021-11-25 18:54:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:14,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:14,283 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 18:54:14,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-25 18:54:14,283 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 18:54:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash 89610851, now seen corresponding path program 26 times [2021-11-25 18:54:14,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:14,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696522992] [2021-11-25 18:54:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:14,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:14,728 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 18:54:14,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:14,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696522992] [2021-11-25 18:54:14,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696522992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:14,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:14,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:54:14,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422296680] [2021-11-25 18:54:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:14,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:54:14,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:14,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:54:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:54:14,730 INFO L87 Difference]: Start difference. First operand 1833 states and 4108 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 18:54:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:16,818 INFO L93 Difference]: Finished difference Result 2925 states and 6563 transitions. [2021-11-25 18:54:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 18:54:16,819 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 18:54:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:16,822 INFO L225 Difference]: With dead ends: 2925 [2021-11-25 18:54:16,822 INFO L226 Difference]: Without dead ends: 2925 [2021-11-25 18:54:16,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:54:16,823 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 468 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:16,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 35 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:54:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2021-11-25 18:54:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1831. [2021-11-25 18:54:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1821 states have (on average 2.2531576057111478) internal successors, (4103), 1830 states have internal predecessors, (4103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 4103 transitions. [2021-11-25 18:54:16,845 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 4103 transitions. Word has length 17 [2021-11-25 18:54:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:16,845 INFO L470 AbstractCegarLoop]: Abstraction has 1831 states and 4103 transitions. [2021-11-25 18:54:16,846 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 18:54:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 4103 transitions. [2021-11-25 18:54:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:16,846 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:16,846 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 18:54:16,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-25 18:54:16,847 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:54:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash -301853279, now seen corresponding path program 27 times [2021-11-25 18:54:16,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:16,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771520077] [2021-11-25 18:54:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:16,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:17,391 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 18:54:17,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771520077] [2021-11-25 18:54:17,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771520077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:17,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:17,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:54:17,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46349453] [2021-11-25 18:54:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:17,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:54:17,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:54:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:54:17,392 INFO L87 Difference]: Start difference. First operand 1831 states and 4103 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 18:54:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:20,200 INFO L93 Difference]: Finished difference Result 3520 states and 7873 transitions. [2021-11-25 18:54:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 18:54:20,201 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 18:54:20,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:20,205 INFO L225 Difference]: With dead ends: 3520 [2021-11-25 18:54:20,205 INFO L226 Difference]: Without dead ends: 3520 [2021-11-25 18:54:20,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2021-11-25 18:54:20,205 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 470 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:20,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 37 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2889 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:54:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3520 states. [2021-11-25 18:54:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3520 to 1837. [2021-11-25 18:54:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1827 states have (on average 2.2534209085933226) internal successors, (4117), 1836 states have internal predecessors, (4117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 4117 transitions. [2021-11-25 18:54:20,231 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 4117 transitions. Word has length 17 [2021-11-25 18:54:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:20,231 INFO L470 AbstractCegarLoop]: Abstraction has 1837 states and 4117 transitions. [2021-11-25 18:54:20,231 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 18:54:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 4117 transitions. [2021-11-25 18:54:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:20,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:20,233 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 18:54:20,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-25 18:54:20,233 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 18:54:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 93261871, now seen corresponding path program 28 times [2021-11-25 18:54:20,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:20,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199521753] [2021-11-25 18:54:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:20,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:20,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 18:54:20,591 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:20,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199521753] [2021-11-25 18:54:20,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199521753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:20,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:20,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:54:20,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032912333] [2021-11-25 18:54:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:20,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:54:20,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:20,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:54:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:54:20,593 INFO L87 Difference]: Start difference. First operand 1837 states and 4117 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 18:54:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:23,114 INFO L93 Difference]: Finished difference Result 3410 states and 7636 transitions. [2021-11-25 18:54:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 18:54:23,115 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 18:54:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:23,118 INFO L225 Difference]: With dead ends: 3410 [2021-11-25 18:54:23,118 INFO L226 Difference]: Without dead ends: 3410 [2021-11-25 18:54:23,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2021-11-25 18:54:23,119 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 638 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:23,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 37 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 18:54:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2021-11-25 18:54:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 1830. [2021-11-25 18:54:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1820 states have (on average 2.2527472527472527) internal successors, (4100), 1829 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 4100 transitions. [2021-11-25 18:54:23,143 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 4100 transitions. Word has length 17 [2021-11-25 18:54:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:23,143 INFO L470 AbstractCegarLoop]: Abstraction has 1830 states and 4100 transitions. [2021-11-25 18:54:23,144 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 18:54:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 4100 transitions. [2021-11-25 18:54:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:23,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:23,145 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 18:54:23,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-25 18:54:23,145 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 18:54:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2073449839, now seen corresponding path program 29 times [2021-11-25 18:54:23,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:23,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216363254] [2021-11-25 18:54:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:23,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:23,754 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 18:54:23,754 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:23,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216363254] [2021-11-25 18:54:23,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216363254] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:23,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:23,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:54:23,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084780151] [2021-11-25 18:54:23,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:23,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:54:23,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:23,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:54:23,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:54:23,756 INFO L87 Difference]: Start difference. First operand 1830 states and 4100 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 18:54:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:27,468 INFO L93 Difference]: Finished difference Result 3887 states and 8758 transitions. [2021-11-25 18:54:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 18:54:27,469 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 18:54:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:27,473 INFO L225 Difference]: With dead ends: 3887 [2021-11-25 18:54:27,473 INFO L226 Difference]: Without dead ends: 3887 [2021-11-25 18:54:27,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:54:27,474 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 494 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:27,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 41 Invalid, 3713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 18:54:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2021-11-25 18:54:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 1833. [2021-11-25 18:54:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1823 states have (on average 2.2528798683488755) internal successors, (4107), 1832 states have internal predecessors, (4107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 4107 transitions. [2021-11-25 18:54:27,516 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 4107 transitions. Word has length 17 [2021-11-25 18:54:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:27,516 INFO L470 AbstractCegarLoop]: Abstraction has 1833 states and 4107 transitions. [2021-11-25 18:54:27,516 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 18:54:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 4107 transitions. [2021-11-25 18:54:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:27,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:27,518 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 18:54:27,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-25 18:54:27,518 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 18:54:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1678334689, now seen corresponding path program 30 times [2021-11-25 18:54:27,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:27,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143072240] [2021-11-25 18:54:27,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:27,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:28,105 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 18:54:28,105 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:28,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143072240] [2021-11-25 18:54:28,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143072240] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:28,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:28,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:54:28,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385746661] [2021-11-25 18:54:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:28,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:54:28,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:28,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:54:28,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:54:28,107 INFO L87 Difference]: Start difference. First operand 1833 states and 4107 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 18:54:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:31,591 INFO L93 Difference]: Finished difference Result 3203 states and 7167 transitions. [2021-11-25 18:54:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 18:54:31,592 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 18:54:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:31,595 INFO L225 Difference]: With dead ends: 3203 [2021-11-25 18:54:31,595 INFO L226 Difference]: Without dead ends: 3203 [2021-11-25 18:54:31,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:54:31,596 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 408 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3858 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:31,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 51 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3858 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 18:54:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2021-11-25 18:54:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 1827. [2021-11-25 18:54:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1817 states have (on average 2.252614199229499) internal successors, (4093), 1826 states have internal predecessors, (4093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 4093 transitions. [2021-11-25 18:54:31,618 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 4093 transitions. Word has length 17 [2021-11-25 18:54:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:31,619 INFO L470 AbstractCegarLoop]: Abstraction has 1827 states and 4093 transitions. [2021-11-25 18:54:31,619 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 18:54:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 4093 transitions. [2021-11-25 18:54:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:31,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:31,620 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 18:54:31,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-25 18:54:31,620 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 18:54:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash -314498893, now seen corresponding path program 31 times [2021-11-25 18:54:31,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:31,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126438816] [2021-11-25 18:54:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:31,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:32,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 18:54:32,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:32,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126438816] [2021-11-25 18:54:32,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126438816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:32,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:32,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:54:32,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819915874] [2021-11-25 18:54:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:32,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:54:32,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:32,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:54:32,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:54:32,498 INFO L87 Difference]: Start difference. First operand 1827 states and 4093 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 18:54:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:37,812 INFO L93 Difference]: Finished difference Result 3639 states and 8184 transitions. [2021-11-25 18:54:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:54:37,813 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 18:54:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:37,817 INFO L225 Difference]: With dead ends: 3639 [2021-11-25 18:54:37,817 INFO L226 Difference]: Without dead ends: 3639 [2021-11-25 18:54:37,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:54:37,818 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 535 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 3220 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:37,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 33 Invalid, 3289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3220 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-25 18:54:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2021-11-25 18:54:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 1830. [2021-11-25 18:54:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1820 states have (on average 2.2527472527472527) internal successors, (4100), 1829 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 4100 transitions. [2021-11-25 18:54:37,843 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 4100 transitions. Word has length 17 [2021-11-25 18:54:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:37,843 INFO L470 AbstractCegarLoop]: Abstraction has 1830 states and 4100 transitions. [2021-11-25 18:54:37,843 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 18:54:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 4100 transitions. [2021-11-25 18:54:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:54:37,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:37,844 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 18:54:37,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-25 18:54:37,844 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:54:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:37,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1345331245, now seen corresponding path program 32 times [2021-11-25 18:54:37,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:37,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386925094] [2021-11-25 18:54:37,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:37,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:38,491 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 18:54:38,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:38,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386925094] [2021-11-25 18:54:38,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386925094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:38,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:38,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:54:38,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653489875] [2021-11-25 18:54:38,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:38,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:54:38,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:54:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:54:38,493 INFO L87 Difference]: Start difference. First operand 1830 states and 4100 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 18:54:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:43,155 INFO L93 Difference]: Finished difference Result 3883 states and 8739 transitions. [2021-11-25 18:54:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 18:54:43,156 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 18:54:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:43,160 INFO L225 Difference]: With dead ends: 3883 [2021-11-25 18:54:43,160 INFO L226 Difference]: Without dead ends: 3883 [2021-11-25 18:54:43,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 18:54:43,161 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 957 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:43,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [957 Valid, 43 Invalid, 3816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 18:54:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2021-11-25 18:54:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 1753. [2021-11-25 18:54:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1743 states have (on average 2.2392426850258174) internal successors, (3903), 1752 states have internal predecessors, (3903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 3903 transitions. [2021-11-25 18:54:43,205 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 3903 transitions. Word has length 17 [2021-11-25 18:54:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:43,205 INFO L470 AbstractCegarLoop]: Abstraction has 1753 states and 3903 transitions. [2021-11-25 18:54:43,205 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 18:54:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 3903 transitions. [2021-11-25 18:54:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:54:43,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:43,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 18:54:43,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-25 18:54:43,206 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 18:54:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -230147840, now seen corresponding path program 1 times [2021-11-25 18:54:43,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:43,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85302140] [2021-11-25 18:54:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:43,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:43,498 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 18:54:43,499 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:43,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85302140] [2021-11-25 18:54:43,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85302140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:43,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:43,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 18:54:43,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443082919] [2021-11-25 18:54:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:43,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:54:43,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:43,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:54:43,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:54:43,500 INFO L87 Difference]: Start difference. First operand 1753 states and 3903 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 18:54:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:44,792 INFO L93 Difference]: Finished difference Result 2295 states and 5090 transitions. [2021-11-25 18:54:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:54:44,792 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 18:54:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:44,795 INFO L225 Difference]: With dead ends: 2295 [2021-11-25 18:54:44,795 INFO L226 Difference]: Without dead ends: 2295 [2021-11-25 18:54:44,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:54:44,795 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 275 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:44,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 24 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 18:54:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2021-11-25 18:54:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1795. [2021-11-25 18:54:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1785 states have (on average 2.2408963585434174) internal successors, (4000), 1794 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 4000 transitions. [2021-11-25 18:54:44,815 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 4000 transitions. Word has length 18 [2021-11-25 18:54:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:44,815 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 4000 transitions. [2021-11-25 18:54:44,815 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 18:54:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 4000 transitions. [2021-11-25 18:54:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:54:44,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:44,816 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 18:54:44,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-25 18:54:44,816 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 18:54:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1887243008, now seen corresponding path program 2 times [2021-11-25 18:54:44,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:44,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800520722] [2021-11-25 18:54:44,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:44,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:45,150 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 18:54:45,150 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:45,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800520722] [2021-11-25 18:54:45,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800520722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:45,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:45,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:54:45,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248451941] [2021-11-25 18:54:45,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:45,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:54:45,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:45,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:54:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:54:45,151 INFO L87 Difference]: Start difference. First operand 1795 states and 4000 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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 18:54:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:46,423 INFO L93 Difference]: Finished difference Result 2402 states and 5311 transitions. [2021-11-25 18:54:46,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:54:46,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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 18:54:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:46,426 INFO L225 Difference]: With dead ends: 2402 [2021-11-25 18:54:46,426 INFO L226 Difference]: Without dead ends: 2402 [2021-11-25 18:54:46,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:54:46,428 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 302 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:46,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 22 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 18:54:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2021-11-25 18:54:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1832. [2021-11-25 18:54:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1822 states have (on average 2.237650933040615) internal successors, (4077), 1831 states have internal predecessors, (4077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4077 transitions. [2021-11-25 18:54:46,461 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4077 transitions. Word has length 18 [2021-11-25 18:54:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:46,461 INFO L470 AbstractCegarLoop]: Abstraction has 1832 states and 4077 transitions. [2021-11-25 18:54:46,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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 18:54:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4077 transitions. [2021-11-25 18:54:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:54:46,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:46,463 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 18:54:46,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-25 18:54:46,463 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 18:54:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1222627524, now seen corresponding path program 3 times [2021-11-25 18:54:46,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:46,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479299045] [2021-11-25 18:54:46,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:46,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:46,766 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 18:54:46,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:46,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479299045] [2021-11-25 18:54:46,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479299045] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:46,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:46,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:54:46,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842847149] [2021-11-25 18:54:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:46,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:54:46,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:54:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:54:46,768 INFO L87 Difference]: Start difference. First operand 1832 states and 4077 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 18:54:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:49,528 INFO L93 Difference]: Finished difference Result 2580 states and 5698 transitions. [2021-11-25 18:54:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 18:54:49,528 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 18:54:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:49,531 INFO L225 Difference]: With dead ends: 2580 [2021-11-25 18:54:49,531 INFO L226 Difference]: Without dead ends: 2580 [2021-11-25 18:54:49,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:54:49,532 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 483 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 3503 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:49,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 50 Invalid, 3571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3503 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 18:54:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2021-11-25 18:54:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1884. [2021-11-25 18:54:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1874 states have (on average 2.2385272145144075) internal successors, (4195), 1883 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 4195 transitions. [2021-11-25 18:54:49,560 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 4195 transitions. Word has length 18 [2021-11-25 18:54:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:49,560 INFO L470 AbstractCegarLoop]: Abstraction has 1884 states and 4195 transitions. [2021-11-25 18:54:49,561 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 18:54:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 4195 transitions. [2021-11-25 18:54:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:54:49,562 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:49,562 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 18:54:49,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-25 18:54:49,562 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 18:54:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash 395327774, now seen corresponding path program 4 times [2021-11-25 18:54:49,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:49,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507192191] [2021-11-25 18:54:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:49,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:49,771 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 18:54:49,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:49,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507192191] [2021-11-25 18:54:49,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507192191] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:49,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:49,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 18:54:49,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211688411] [2021-11-25 18:54:49,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:49,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:54:49,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:54:49,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:54:49,773 INFO L87 Difference]: Start difference. First operand 1884 states and 4195 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 18:54:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:51,785 INFO L93 Difference]: Finished difference Result 2478 states and 5481 transitions. [2021-11-25 18:54:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:54:51,786 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 18:54:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:51,789 INFO L225 Difference]: With dead ends: 2478 [2021-11-25 18:54:51,789 INFO L226 Difference]: Without dead ends: 2478 [2021-11-25 18:54:51,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:54:51,789 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 499 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:51,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 24 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:54:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2021-11-25 18:54:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 1895. [2021-11-25 18:54:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1885 states have (on average 2.2376657824933686) internal successors, (4218), 1894 states have internal predecessors, (4218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 4218 transitions. [2021-11-25 18:54:51,811 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 4218 transitions. Word has length 18 [2021-11-25 18:54:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:51,811 INFO L470 AbstractCegarLoop]: Abstraction has 1895 states and 4218 transitions. [2021-11-25 18:54:51,811 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 18:54:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 4218 transitions. [2021-11-25 18:54:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:54:51,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:51,812 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 18:54:51,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-25 18:54:51,813 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 18:54:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1261767394, now seen corresponding path program 5 times [2021-11-25 18:54:51,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:51,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672522101] [2021-11-25 18:54:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:51,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:52,048 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 18:54:52,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:52,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672522101] [2021-11-25 18:54:52,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672522101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:52,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:52,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:54:52,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069450055] [2021-11-25 18:54:52,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:52,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:54:52,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:54:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:54:52,049 INFO L87 Difference]: Start difference. First operand 1895 states and 4218 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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 18:54:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:54,334 INFO L93 Difference]: Finished difference Result 2539 states and 5602 transitions. [2021-11-25 18:54:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 18:54:54,334 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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 18:54:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:54,337 INFO L225 Difference]: With dead ends: 2539 [2021-11-25 18:54:54,337 INFO L226 Difference]: Without dead ends: 2539 [2021-11-25 18:54:54,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=747, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:54:54,338 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 527 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:54,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 28 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2162 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 18:54:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2021-11-25 18:54:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 1902. [2021-11-25 18:54:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1892 states have (on average 2.236786469344609) internal successors, (4232), 1901 states have internal predecessors, (4232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 4232 transitions. [2021-11-25 18:54:54,360 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 4232 transitions. Word has length 18 [2021-11-25 18:54:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:54,361 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 4232 transitions. [2021-11-25 18:54:54,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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 18:54:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 4232 transitions. [2021-11-25 18:54:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:54:54,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:54,362 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 18:54:54,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-25 18:54:54,362 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:54:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1848103138, now seen corresponding path program 6 times [2021-11-25 18:54:54,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:54,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365908980] [2021-11-25 18:54:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:54,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:54,613 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 18:54:54,613 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:54,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365908980] [2021-11-25 18:54:54,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365908980] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:54,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:54,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:54:54,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478643385] [2021-11-25 18:54:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:54,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:54:54,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:54:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:54:54,614 INFO L87 Difference]: Start difference. First operand 1902 states and 4232 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 18:54:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:54:57,974 INFO L93 Difference]: Finished difference Result 2921 states and 6425 transitions. [2021-11-25 18:54:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 18:54:57,974 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 18:54:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:54:57,977 INFO L225 Difference]: With dead ends: 2921 [2021-11-25 18:54:57,977 INFO L226 Difference]: Without dead ends: 2921 [2021-11-25 18:54:57,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=798, Invalid=2172, Unknown=0, NotChecked=0, Total=2970 [2021-11-25 18:54:57,978 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 861 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:54:57,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 44 Invalid, 3844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 18:54:57,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2021-11-25 18:54:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1897. [2021-11-25 18:54:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1887 states have (on average 2.2379438261791202) internal successors, (4223), 1896 states have internal predecessors, (4223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:54:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 4223 transitions. [2021-11-25 18:54:58,002 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 4223 transitions. Word has length 18 [2021-11-25 18:54:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:54:58,002 INFO L470 AbstractCegarLoop]: Abstraction has 1897 states and 4223 transitions. [2021-11-25 18:54:58,002 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 18:54:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 4223 transitions. [2021-11-25 18:54:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:54:58,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:54:58,003 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 18:54:58,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-25 18:54:58,003 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 18:54:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:54:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 69876636, now seen corresponding path program 7 times [2021-11-25 18:54:58,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:54:58,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538695593] [2021-11-25 18:54:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:54:58,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:54:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:54:58,222 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 18:54:58,222 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:54:58,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538695593] [2021-11-25 18:54:58,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538695593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:54:58,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:54:58,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 18:54:58,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141247039] [2021-11-25 18:54:58,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:54:58,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:54:58,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:54:58,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:54:58,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:54:58,224 INFO L87 Difference]: Start difference. First operand 1897 states and 4223 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 18:55:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:00,008 INFO L93 Difference]: Finished difference Result 2773 states and 6096 transitions. [2021-11-25 18:55:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 18:55:00,008 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 18:55:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:00,011 INFO L225 Difference]: With dead ends: 2773 [2021-11-25 18:55:00,011 INFO L226 Difference]: Without dead ends: 2773 [2021-11-25 18:55:00,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:55:00,012 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 528 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:00,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 26 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:55:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2021-11-25 18:55:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 1879. [2021-11-25 18:55:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1869 states have (on average 2.240235420010701) internal successors, (4187), 1878 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4187 transitions. [2021-11-25 18:55:00,042 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4187 transitions. Word has length 18 [2021-11-25 18:55:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:00,042 INFO L470 AbstractCegarLoop]: Abstraction has 1879 states and 4187 transitions. [2021-11-25 18:55:00,042 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 18:55:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4187 transitions. [2021-11-25 18:55:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:55:00,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:00,044 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 18:55:00,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-25 18:55:00,044 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 18:55:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1115220128, now seen corresponding path program 8 times [2021-11-25 18:55:00,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:00,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033475690] [2021-11-25 18:55:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:00,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:00,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 18:55:00,324 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:00,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033475690] [2021-11-25 18:55:00,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033475690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:00,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:00,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:55:00,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43340172] [2021-11-25 18:55:00,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:00,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:55:00,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:00,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:55:00,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:55:00,326 INFO L87 Difference]: Start difference. First operand 1879 states and 4187 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 18:55:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:03,883 INFO L93 Difference]: Finished difference Result 2955 states and 6492 transitions. [2021-11-25 18:55:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 18:55:03,884 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 18:55:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:03,887 INFO L225 Difference]: With dead ends: 2955 [2021-11-25 18:55:03,887 INFO L226 Difference]: Without dead ends: 2955 [2021-11-25 18:55:03,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=833, Invalid=2359, Unknown=0, NotChecked=0, Total=3192 [2021-11-25 18:55:03,887 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 861 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 4048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:03,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 44 Invalid, 4048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:55:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2021-11-25 18:55:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1867. [2021-11-25 18:55:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1857 states have (on average 2.2407108239095317) internal successors, (4161), 1866 states have internal predecessors, (4161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4161 transitions. [2021-11-25 18:55:03,914 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4161 transitions. Word has length 18 [2021-11-25 18:55:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:03,915 INFO L470 AbstractCegarLoop]: Abstraction has 1867 states and 4161 transitions. [2021-11-25 18:55:03,915 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 18:55:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4161 transitions. [2021-11-25 18:55:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:55:03,916 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:03,916 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 18:55:03,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-25 18:55:03,916 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 18:55:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1930502266, now seen corresponding path program 9 times [2021-11-25 18:55:03,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:03,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936355360] [2021-11-25 18:55:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:03,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:04,378 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 18:55:04,378 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:04,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936355360] [2021-11-25 18:55:04,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936355360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:04,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:04,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:55:04,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505574016] [2021-11-25 18:55:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:04,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:55:04,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:04,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:55:04,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:55:04,380 INFO L87 Difference]: Start difference. First operand 1867 states and 4161 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 18:55:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:07,881 INFO L93 Difference]: Finished difference Result 2884 states and 6347 transitions. [2021-11-25 18:55:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-25 18:55:07,881 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 18:55:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:07,884 INFO L225 Difference]: With dead ends: 2884 [2021-11-25 18:55:07,884 INFO L226 Difference]: Without dead ends: 2884 [2021-11-25 18:55:07,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=523, Invalid=1457, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:55:07,885 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 724 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:07,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 29 Invalid, 2483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 18:55:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2021-11-25 18:55:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1834. [2021-11-25 18:55:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1824 states have (on average 2.236842105263158) internal successors, (4080), 1833 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 4080 transitions. [2021-11-25 18:55:07,922 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 4080 transitions. Word has length 18 [2021-11-25 18:55:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:07,923 INFO L470 AbstractCegarLoop]: Abstraction has 1834 states and 4080 transitions. [2021-11-25 18:55:07,923 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 18:55:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 4080 transitions. [2021-11-25 18:55:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:55:07,924 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:07,924 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 18:55:07,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-25 18:55:07,924 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 18:55:07,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash 220107676, now seen corresponding path program 10 times [2021-11-25 18:55:07,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:07,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121768288] [2021-11-25 18:55:07,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:07,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:08,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 18:55:08,137 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:08,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121768288] [2021-11-25 18:55:08,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121768288] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:08,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:08,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:55:08,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662598554] [2021-11-25 18:55:08,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:08,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:55:08,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:08,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:55:08,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:55:08,139 INFO L87 Difference]: Start difference. First operand 1834 states and 4080 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 18:55:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:11,469 INFO L93 Difference]: Finished difference Result 2821 states and 6208 transitions. [2021-11-25 18:55:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-25 18:55:11,469 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 18:55:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:11,472 INFO L225 Difference]: With dead ends: 2821 [2021-11-25 18:55:11,472 INFO L226 Difference]: Without dead ends: 2821 [2021-11-25 18:55:11,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=935, Invalid=2847, Unknown=0, NotChecked=0, Total=3782 [2021-11-25 18:55:11,473 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 982 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:11,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 36 Invalid, 3402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 18:55:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2021-11-25 18:55:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 1810. [2021-11-25 18:55:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1800 states have (on average 2.236666666666667) internal successors, (4026), 1809 states have internal predecessors, (4026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 4026 transitions. [2021-11-25 18:55:11,527 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 4026 transitions. Word has length 18 [2021-11-25 18:55:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:11,527 INFO L470 AbstractCegarLoop]: Abstraction has 1810 states and 4026 transitions. [2021-11-25 18:55:11,527 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 18:55:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 4026 transitions. [2021-11-25 18:55:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:55:11,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:11,528 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 18:55:11,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-25 18:55:11,528 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 18:55:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1302206664, now seen corresponding path program 11 times [2021-11-25 18:55:11,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:11,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437501094] [2021-11-25 18:55:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:11,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:11,747 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 18:55:11,747 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:11,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437501094] [2021-11-25 18:55:11,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437501094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:11,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:11,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 18:55:11,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7060440] [2021-11-25 18:55:11,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:11,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 18:55:11,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:11,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 18:55:11,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:55:11,748 INFO L87 Difference]: Start difference. First operand 1810 states and 4026 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 18:55:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:13,202 INFO L93 Difference]: Finished difference Result 2139 states and 4734 transitions. [2021-11-25 18:55:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:55:13,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 18:55:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:13,205 INFO L225 Difference]: With dead ends: 2139 [2021-11-25 18:55:13,205 INFO L226 Difference]: Without dead ends: 2139 [2021-11-25 18:55:13,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:55:13,206 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 211 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:13,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 27 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 18:55:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2021-11-25 18:55:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1812. [2021-11-25 18:55:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1802 states have (on average 2.2358490566037736) internal successors, (4029), 1811 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 4029 transitions. [2021-11-25 18:55:13,253 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 4029 transitions. Word has length 18 [2021-11-25 18:55:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:13,254 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 4029 transitions. [2021-11-25 18:55:13,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 18:55:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 4029 transitions. [2021-11-25 18:55:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:55:13,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:13,255 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 18:55:13,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-25 18:55:13,255 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 18:55:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1335665464, now seen corresponding path program 12 times [2021-11-25 18:55:13,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:13,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848165402] [2021-11-25 18:55:13,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:13,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:13,491 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 18:55:13,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:13,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848165402] [2021-11-25 18:55:13,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848165402] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:13,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:13,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 18:55:13,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545184021] [2021-11-25 18:55:13,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:13,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:55:13,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:55:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:55:13,493 INFO L87 Difference]: Start difference. First operand 1812 states and 4029 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 18:55:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:15,029 INFO L93 Difference]: Finished difference Result 2179 states and 4814 transitions. [2021-11-25 18:55:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 18:55:15,029 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 18:55:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:15,033 INFO L225 Difference]: With dead ends: 2179 [2021-11-25 18:55:15,033 INFO L226 Difference]: Without dead ends: 2179 [2021-11-25 18:55:15,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:55:15,033 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 283 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:15,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 27 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 18:55:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2021-11-25 18:55:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 1815. [2021-11-25 18:55:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1805 states have (on average 2.2354570637119116) internal successors, (4035), 1814 states have internal predecessors, (4035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 4035 transitions. [2021-11-25 18:55:15,059 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 4035 transitions. Word has length 18 [2021-11-25 18:55:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:15,059 INFO L470 AbstractCegarLoop]: Abstraction has 1815 states and 4035 transitions. [2021-11-25 18:55:15,059 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 18:55:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 4035 transitions. [2021-11-25 18:55:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:55:15,060 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:15,060 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 18:55:15,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-25 18:55:15,061 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 18:55:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash 150568700, now seen corresponding path program 13 times [2021-11-25 18:55:15,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:15,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126478553] [2021-11-25 18:55:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:15,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:15,196 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 18:55:15,196 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126478553] [2021-11-25 18:55:15,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126478553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:15,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:15,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 18:55:15,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618022488] [2021-11-25 18:55:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:15,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:55:15,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:15,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:55:15,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:55:15,199 INFO L87 Difference]: Start difference. First operand 1815 states and 4035 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 18:55:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:15,950 INFO L93 Difference]: Finished difference Result 1902 states and 4198 transitions. [2021-11-25 18:55:15,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:55:15,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 18:55:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:15,953 INFO L225 Difference]: With dead ends: 1902 [2021-11-25 18:55:15,953 INFO L226 Difference]: Without dead ends: 1902 [2021-11-25 18:55:15,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:55:15,953 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 205 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:15,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 24 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:55:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2021-11-25 18:55:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1802. [2021-11-25 18:55:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1792 states have (on average 2.240513392857143) internal successors, (4015), 1801 states have internal predecessors, (4015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 4015 transitions. [2021-11-25 18:55:15,974 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 4015 transitions. Word has length 18 [2021-11-25 18:55:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:15,975 INFO L470 AbstractCegarLoop]: Abstraction has 1802 states and 4015 transitions. [2021-11-25 18:55:15,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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 18:55:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 4015 transitions. [2021-11-25 18:55:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:55:15,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:15,975 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 18:55:15,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-25 18:55:15,976 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:55:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 288855043, now seen corresponding path program 1 times [2021-11-25 18:55:15,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:15,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380735695] [2021-11-25 18:55:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:15,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:16,388 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 18:55:16,388 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:16,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380735695] [2021-11-25 18:55:16,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380735695] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:16,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:16,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:55:16,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114845696] [2021-11-25 18:55:16,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:16,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:55:16,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:16,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:55:16,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:55:16,390 INFO L87 Difference]: Start difference. First operand 1802 states and 4015 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 18:55:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:18,585 INFO L93 Difference]: Finished difference Result 1922 states and 4240 transitions. [2021-11-25 18:55:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 18:55:18,585 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 18:55:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:18,587 INFO L225 Difference]: With dead ends: 1922 [2021-11-25 18:55:18,587 INFO L226 Difference]: Without dead ends: 1922 [2021-11-25 18:55:18,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2021-11-25 18:55:18,588 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 305 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:18,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 47 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 18:55:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2021-11-25 18:55:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1814. [2021-11-25 18:55:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1804 states have (on average 2.2361419068736144) internal successors, (4034), 1813 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 4034 transitions. [2021-11-25 18:55:18,607 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 4034 transitions. Word has length 18 [2021-11-25 18:55:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:18,607 INFO L470 AbstractCegarLoop]: Abstraction has 1814 states and 4034 transitions. [2021-11-25 18:55:18,607 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 18:55:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 4034 transitions. [2021-11-25 18:55:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:55:18,607 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:18,608 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 18:55:18,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-25 18:55:18,608 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 18:55:18,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1003280952, now seen corresponding path program 1 times [2021-11-25 18:55:18,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:18,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561052466] [2021-11-25 18:55:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:18,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:18,953 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 18:55:18,953 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:18,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561052466] [2021-11-25 18:55:18,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561052466] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:55:18,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065255740] [2021-11-25 18:55:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:18,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:55:18,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:55:18,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:55:18,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:55:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:19,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 132 conjunts are in the unsatisfiable core [2021-11-25 18:55:19,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:55:19,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,690 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 18:55:19,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,722 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 18:55:19,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,740 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 18:55:19,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,769 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-25 18:55:19,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 69 [2021-11-25 18:55:19,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:19,781 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 18:55:20,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:20,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:20,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:55:20,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 24 [2021-11-25 18:55:20,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:20,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:20,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:20,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:20,594 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:55:20,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:20,673 INFO L354 Elim1Store]: treesize reduction 197, result has 22.1 percent of original size [2021-11-25 18:55:20,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 93 [2021-11-25 18:55:20,860 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-25 18:55:20,861 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 2 case distinctions, treesize of input 134 treesize of output 85 [2021-11-25 18:55:20,866 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 47 treesize of output 37 [2021-11-25 18:55:21,046 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:55:21,049 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 18:55:21,052 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 18:55:21,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:55:21,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5823 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5823) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:21,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5822 Int) (v_ArrVal_5823 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_5822)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_5823) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:21,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5822 Int) (v_ArrVal_5823 (Array Int Int))) (not (= (select (select (store (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) .cse1))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) .cse1) v_ArrVal_5822)))) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_5823) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:21,120 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5822 Int) (v_ArrVal_5823 (Array Int Int))) (not (= (select (select (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (store (let ((.cse2 (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_5822)))) .cse1 v_ArrVal_5823))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:21,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5822 Int) (v_ArrVal_5823 (Array Int Int))) (not (= (select (select (let ((.cse3 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (store (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) 12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_5822)))) .cse1 v_ArrVal_5823))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:21,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5822 Int) (v_ArrVal_5823 (Array Int Int))) (not (= (select (select (let ((.cse3 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3))) (store (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3) 12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_5822)))) .cse1 v_ArrVal_5823))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:21,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5822 Int) (v_ArrVal_5823 (Array Int Int))) (not (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3))) (store (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3) 12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_5822)))) .cse1 v_ArrVal_5823))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:21,167 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 18:55:21,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065255740] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:55:21,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1928340147] [2021-11-25 18:55:21,174 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 18:55:21,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:55:21,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 29 [2021-11-25 18:55:21,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61476539] [2021-11-25 18:55:21,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:55:21,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 18:55:21,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 18:55:21,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=460, Unknown=7, NotChecked=350, Total=930 [2021-11-25 18:55:21,182 INFO L87 Difference]: Start difference. First operand 1814 states and 4034 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 18:55:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:25,727 INFO L93 Difference]: Finished difference Result 3161 states and 7071 transitions. [2021-11-25 18:55:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 18:55:25,728 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 18:55:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:25,732 INFO L225 Difference]: With dead ends: 3161 [2021-11-25 18:55:25,733 INFO L226 Difference]: Without dead ends: 3161 [2021-11-25 18:55:25,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=454, Invalid=1459, Unknown=7, NotChecked=630, Total=2550 [2021-11-25 18:55:25,734 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 988 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 3350 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 6041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2649 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:25,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [988 Valid, 43 Invalid, 6041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3350 Invalid, 0 Unknown, 2649 Unchecked, 2.9s Time] [2021-11-25 18:55:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2021-11-25 18:55:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 1891. [2021-11-25 18:55:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1881 states have (on average 2.2402977139819247) internal successors, (4214), 1890 states have internal predecessors, (4214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 4214 transitions. [2021-11-25 18:55:25,772 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 4214 transitions. Word has length 19 [2021-11-25 18:55:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:25,772 INFO L470 AbstractCegarLoop]: Abstraction has 1891 states and 4214 transitions. [2021-11-25 18:55:25,773 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 18:55:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 4214 transitions. [2021-11-25 18:55:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:55:25,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:25,775 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 18:55:25,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:55:25,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:55:25,988 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 18:55:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2138925856, now seen corresponding path program 2 times [2021-11-25 18:55:25,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:25,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304939678] [2021-11-25 18:55:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:25,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:26,353 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 18:55:26,354 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:26,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304939678] [2021-11-25 18:55:26,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304939678] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:55:26,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511883648] [2021-11-25 18:55:26,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:55:26,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:55:26,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:55:26,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:55:26,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:55:26,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:55:26,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:55:26,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 110 conjunts are in the unsatisfiable core [2021-11-25 18:55:26,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:55:26,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,927 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 18:55:26,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,939 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 18:55:26,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,951 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 18:55:26,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,963 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 18:55:26,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:26,974 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 18:55:27,021 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 18:55:27,022 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 18:55:27,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:27,038 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 18:55:27,050 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 18:55:27,412 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 18:55:27,596 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:55:27,597 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 18:55:27,610 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 18:55:27,692 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:55:27,692 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 18:55:27,814 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:55:27,816 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 18:55:27,818 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 18:55:27,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:55:27,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6011 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6011) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:27,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6011 (Array Int Int)) (v_ArrVal_6010 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_6010) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6011) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:27,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6011 (Array Int Int)) (v_ArrVal_6010 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_6010) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_6011) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:27,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6011 (Array Int Int)) (v_ArrVal_6010 (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_6010) .cse0 v_ArrVal_6011))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:27,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6011 (Array Int Int)) (v_ArrVal_6010 (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_6010) .cse0 v_ArrVal_6011))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:27,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6011 (Array Int Int)) (v_ArrVal_6010 (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_6010) .cse0 v_ArrVal_6011))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:27,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6011 (Array Int Int)) (v_ArrVal_6010 (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_6010) .cse0 v_ArrVal_6011))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:27,922 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 18:55:27,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511883648] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:55:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [272040383] [2021-11-25 18:55:27,924 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 18:55:27,925 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:55:27,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2021-11-25 18:55:27,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278723101] [2021-11-25 18:55:27,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:55:27,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 18:55:27,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 18:55:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=426, Unknown=7, NotChecked=336, Total=870 [2021-11-25 18:55:27,927 INFO L87 Difference]: Start difference. First operand 1891 states and 4214 transitions. Second operand has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:32,935 INFO L93 Difference]: Finished difference Result 3636 states and 8034 transitions. [2021-11-25 18:55:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:55:32,936 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 18:55:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:32,939 INFO L225 Difference]: With dead ends: 3636 [2021-11-25 18:55:32,940 INFO L226 Difference]: Without dead ends: 3636 [2021-11-25 18:55:32,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=476, Invalid=2095, Unknown=7, NotChecked=728, Total=3306 [2021-11-25 18:55:32,940 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 1015 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 4728 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4021 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:32,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1015 Valid, 58 Invalid, 8779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4728 Invalid, 0 Unknown, 4021 Unchecked, 3.1s Time] [2021-11-25 18:55:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2021-11-25 18:55:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 1986. [2021-11-25 18:55:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1976 states have (on average 2.2535425101214575) internal successors, (4453), 1985 states have internal predecessors, (4453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 4453 transitions. [2021-11-25 18:55:32,981 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 4453 transitions. Word has length 19 [2021-11-25 18:55:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:32,982 INFO L470 AbstractCegarLoop]: Abstraction has 1986 states and 4453 transitions. [2021-11-25 18:55:32,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 4453 transitions. [2021-11-25 18:55:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:55:32,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:32,983 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 18:55:33,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:55:33,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:55:33,196 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 18:55:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1802526122, now seen corresponding path program 3 times [2021-11-25 18:55:33,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:33,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336133266] [2021-11-25 18:55:33,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:33,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:33,512 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 18:55:33,512 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:33,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336133266] [2021-11-25 18:55:33,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336133266] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:55:33,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127387084] [2021-11-25 18:55:33,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:55:33,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:55:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:55:33,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:55:33,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:55:33,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:55:33,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:55:33,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 155 conjunts are in the unsatisfiable core [2021-11-25 18:55:33,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:55:33,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:33,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:33,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2021-11-25 18:55:33,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:33,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:33,985 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 18:55:34,009 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 18:55:34,010 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 135 treesize of output 109 [2021-11-25 18:55:34,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,020 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 18:55:34,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,034 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 49 treesize of output 42 [2021-11-25 18:55:34,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:55:34,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:55:34,648 INFO L354 Elim1Store]: treesize reduction 28, result has 9.7 percent of original size [2021-11-25 18:55:34,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 22 [2021-11-25 18:55:34,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:55:34,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:55:34,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:55:34,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:55:34,748 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 18:55:34,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 104 treesize of output 84 [2021-11-25 18:55:34,885 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-25 18:55:34,885 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 4 case distinctions, treesize of input 82 treesize of output 57 [2021-11-25 18:55:34,889 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 18:55:34,969 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 18:55:35,088 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:55:35,088 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 18:55:35,092 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 18:55:35,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:55:35,114 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 18:55:35,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6218 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6218) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:35,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6216 Int) (v_ArrVal_6218 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6216)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6218) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:35,145 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6216 Int) (v_ArrVal_6218 (Array Int Int))) (not (= (select (select (store (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) .cse1))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) .cse1) v_ArrVal_6216)))) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_6218) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:35,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6216 Int) (v_ArrVal_6218 (Array Int Int))) (not (= (select (select (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (store (let ((.cse2 (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_6216)))) .cse1 v_ArrVal_6218))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:35,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6216 Int) (v_ArrVal_6218 (Array Int Int))) (not (= (select (select (let ((.cse3 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (store (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) 12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_6216)))) .cse1 v_ArrVal_6218))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:35,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6216 Int) (v_ArrVal_6218 (Array Int Int))) (not (= (select (select (let ((.cse3 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3))) (store (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3) 12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_6216)))) .cse1 v_ArrVal_6218))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:35,211 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6216 Int) (v_ArrVal_6218 (Array Int Int))) (not (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3))) (store (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3) 12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_6216)))) .cse1 v_ArrVal_6218))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:55:35,212 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 18:55:35,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127387084] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:55:35,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [276881783] [2021-11-25 18:55:35,213 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 18:55:35,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:55:35,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2021-11-25 18:55:35,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947728333] [2021-11-25 18:55:35,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:55:35,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 18:55:35,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:35,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 18:55:35,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=454, Unknown=7, NotChecked=350, Total=930 [2021-11-25 18:55:35,216 INFO L87 Difference]: Start difference. First operand 1986 states and 4453 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 18:55:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:38,657 INFO L93 Difference]: Finished difference Result 3320 states and 7436 transitions. [2021-11-25 18:55:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-25 18:55:38,658 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 18:55:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:38,661 INFO L225 Difference]: With dead ends: 3320 [2021-11-25 18:55:38,661 INFO L226 Difference]: Without dead ends: 3320 [2021-11-25 18:55:38,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=368, Invalid=1545, Unknown=7, NotChecked=630, Total=2550 [2021-11-25 18:55:38,662 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 1416 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 6116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2695 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:38,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1416 Valid, 54 Invalid, 6116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3389 Invalid, 0 Unknown, 2695 Unchecked, 2.3s Time] [2021-11-25 18:55:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2021-11-25 18:55:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 1984. [2021-11-25 18:55:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1974 states have (on average 2.2527862208713274) internal successors, (4447), 1983 states have internal predecessors, (4447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 4447 transitions. [2021-11-25 18:55:38,688 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 4447 transitions. Word has length 19 [2021-11-25 18:55:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:38,688 INFO L470 AbstractCegarLoop]: Abstraction has 1984 states and 4447 transitions. [2021-11-25 18:55:38,688 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 18:55:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 4447 transitions. [2021-11-25 18:55:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:55:38,689 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:38,689 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 18:55:38,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:55:38,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2021-11-25 18:55:38,890 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 18:55:38,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash -253695240, now seen corresponding path program 1 times [2021-11-25 18:55:38,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:38,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760579754] [2021-11-25 18:55:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:38,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:39,633 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 18:55:39,633 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:39,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760579754] [2021-11-25 18:55:39,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760579754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:39,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:39,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 18:55:39,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113628646] [2021-11-25 18:55:39,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:39,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 18:55:39,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:39,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 18:55:39,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:55:39,635 INFO L87 Difference]: Start difference. First operand 1984 states and 4447 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 18:55:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:42,538 INFO L93 Difference]: Finished difference Result 3221 states and 7157 transitions. [2021-11-25 18:55:42,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 18:55:42,539 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 18:55:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:42,560 INFO L225 Difference]: With dead ends: 3221 [2021-11-25 18:55:42,561 INFO L226 Difference]: Without dead ends: 3221 [2021-11-25 18:55:42,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:55:42,561 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 811 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:42,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [811 Valid, 29 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 18:55:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2021-11-25 18:55:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 2064. [2021-11-25 18:55:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 2054 states have (on average 2.254625121713729) internal successors, (4631), 2063 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 4631 transitions. [2021-11-25 18:55:42,588 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 4631 transitions. Word has length 20 [2021-11-25 18:55:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:42,589 INFO L470 AbstractCegarLoop]: Abstraction has 2064 states and 4631 transitions. [2021-11-25 18:55:42,589 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 18:55:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 4631 transitions. [2021-11-25 18:55:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:55:42,590 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:42,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] [2021-11-25 18:55:42,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-25 18:55:42,590 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 18:55:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2052925846, now seen corresponding path program 2 times [2021-11-25 18:55:42,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:42,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471020930] [2021-11-25 18:55:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:42,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:42,960 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 18:55:42,960 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:42,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471020930] [2021-11-25 18:55:42,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471020930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:42,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:42,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:55:42,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647659631] [2021-11-25 18:55:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:42,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:55:42,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:55:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:55:42,961 INFO L87 Difference]: Start difference. First operand 2064 states and 4631 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 18:55:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:45,477 INFO L93 Difference]: Finished difference Result 2716 states and 5999 transitions. [2021-11-25 18:55:45,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:55:45,477 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 18:55:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:45,480 INFO L225 Difference]: With dead ends: 2716 [2021-11-25 18:55:45,480 INFO L226 Difference]: Without dead ends: 2716 [2021-11-25 18:55:45,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:55:45,481 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 495 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 3344 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:45,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 34 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3344 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 18:55:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2021-11-25 18:55:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2222. [2021-11-25 18:55:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2212 states have (on average 2.2450271247739604) internal successors, (4966), 2221 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 4966 transitions. [2021-11-25 18:55:45,505 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 4966 transitions. Word has length 20 [2021-11-25 18:55:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:45,505 INFO L470 AbstractCegarLoop]: Abstraction has 2222 states and 4966 transitions. [2021-11-25 18:55:45,505 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 18:55:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 4966 transitions. [2021-11-25 18:55:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:55:45,507 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:45,507 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 18:55:45,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-25 18:55:45,508 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 18:55:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1943983524, now seen corresponding path program 3 times [2021-11-25 18:55:45,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:45,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991914047] [2021-11-25 18:55:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:45,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:46,158 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 18:55:46,158 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991914047] [2021-11-25 18:55:46,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991914047] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:46,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:46,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 18:55:46,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488046761] [2021-11-25 18:55:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:46,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 18:55:46,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 18:55:46,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:55:46,159 INFO L87 Difference]: Start difference. First operand 2222 states and 4966 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 18:55:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:50,250 INFO L93 Difference]: Finished difference Result 3672 states and 8161 transitions. [2021-11-25 18:55:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:55:50,251 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 18:55:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:50,255 INFO L225 Difference]: With dead ends: 3672 [2021-11-25 18:55:50,255 INFO L226 Difference]: Without dead ends: 3672 [2021-11-25 18:55:50,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=387, Invalid=1419, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 18:55:50,256 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 696 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 4051 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:50,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 37 Invalid, 4106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4051 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-25 18:55:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2021-11-25 18:55:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 2218. [2021-11-25 18:55:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2208 states have (on average 2.2454710144927534) internal successors, (4958), 2217 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 4958 transitions. [2021-11-25 18:55:50,301 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 4958 transitions. Word has length 20 [2021-11-25 18:55:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:50,302 INFO L470 AbstractCegarLoop]: Abstraction has 2218 states and 4958 transitions. [2021-11-25 18:55:50,302 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 18:55:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 4958 transitions. [2021-11-25 18:55:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:55:50,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:50,303 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 18:55:50,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-25 18:55:50,303 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 18:55:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash -675173584, now seen corresponding path program 4 times [2021-11-25 18:55:50,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:50,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30884114] [2021-11-25 18:55:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:50,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:55:52,456 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 18:55:52,457 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:55:52,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30884114] [2021-11-25 18:55:52,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30884114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:55:52,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:55:52,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:55:52,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513725893] [2021-11-25 18:55:52,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:55:52,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:55:52,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:55:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:55:52,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:55:52,458 INFO L87 Difference]: Start difference. First operand 2218 states and 4958 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 18:55:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:55:58,951 INFO L93 Difference]: Finished difference Result 2769 states and 6142 transitions. [2021-11-25 18:55:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 18:55:58,951 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 18:55:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:55:58,954 INFO L225 Difference]: With dead ends: 2769 [2021-11-25 18:55:58,954 INFO L226 Difference]: Without dead ends: 2769 [2021-11-25 18:55:58,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=480, Invalid=2172, Unknown=0, NotChecked=0, Total=2652 [2021-11-25 18:55:58,954 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 780 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 5130 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 5185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 5130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:55:58,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [780 Valid, 45 Invalid, 5185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 5130 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-11-25 18:55:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2021-11-25 18:55:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2270. [2021-11-25 18:55:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2260 states have (on average 2.2486725663716816) internal successors, (5082), 2269 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:55:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 5082 transitions. [2021-11-25 18:55:58,979 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 5082 transitions. Word has length 20 [2021-11-25 18:55:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:55:58,979 INFO L470 AbstractCegarLoop]: Abstraction has 2270 states and 5082 transitions. [2021-11-25 18:55:58,979 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 18:55:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 5082 transitions. [2021-11-25 18:55:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:55:58,980 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:55:58,980 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 18:55:58,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-25 18:55:58,981 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 18:55:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:55:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash -784115906, now seen corresponding path program 5 times [2021-11-25 18:55:58,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:55:58,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223426883] [2021-11-25 18:55:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:55:58,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:55:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:00,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 18:56:00,255 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:56:00,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223426883] [2021-11-25 18:56:00,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223426883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:56:00,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:56:00,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 18:56:00,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453035357] [2021-11-25 18:56:00,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:56:00,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:56:00,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:56:00,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:56:00,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:56:00,257 INFO L87 Difference]: Start difference. First operand 2270 states and 5082 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 18:56:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:56:06,246 INFO L93 Difference]: Finished difference Result 3414 states and 7608 transitions. [2021-11-25 18:56:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 18:56:06,247 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 18:56:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:56:06,267 INFO L225 Difference]: With dead ends: 3414 [2021-11-25 18:56:06,267 INFO L226 Difference]: Without dead ends: 3414 [2021-11-25 18:56:06,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=467, Invalid=1983, Unknown=0, NotChecked=0, Total=2450 [2021-11-25 18:56:06,267 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 742 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 4924 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 4924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:56:06,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 43 Invalid, 4986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 4924 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-25 18:56:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2021-11-25 18:56:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 2218. [2021-11-25 18:56:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2208 states have (on average 2.2454710144927534) internal successors, (4958), 2217 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:56:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 4958 transitions. [2021-11-25 18:56:06,306 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 4958 transitions. Word has length 20 [2021-11-25 18:56:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:56:06,307 INFO L470 AbstractCegarLoop]: Abstraction has 2218 states and 4958 transitions. [2021-11-25 18:56:06,307 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 18:56:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 4958 transitions. [2021-11-25 18:56:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:56:06,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:56:06,309 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 18:56:06,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-25 18:56:06,309 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 18:56:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:56:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1894261904, now seen corresponding path program 6 times [2021-11-25 18:56:06,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:56:06,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033530136] [2021-11-25 18:56:06,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:56:06,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:56:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:08,002 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 18:56:08,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:56:08,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033530136] [2021-11-25 18:56:08,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033530136] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:56:08,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:56:08,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:56:08,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956334970] [2021-11-25 18:56:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:56:08,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:56:08,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:56:08,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:56:08,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:56:08,003 INFO L87 Difference]: Start difference. First operand 2218 states and 4958 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 18:56:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:56:16,326 INFO L93 Difference]: Finished difference Result 3181 states and 7077 transitions. [2021-11-25 18:56:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 18:56:16,326 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 18:56:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:56:16,329 INFO L225 Difference]: With dead ends: 3181 [2021-11-25 18:56:16,329 INFO L226 Difference]: Without dead ends: 3181 [2021-11-25 18:56:16,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=387, Invalid=1775, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 18:56:16,330 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1037 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 5009 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 5009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:56:16,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 39 Invalid, 5090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 5009 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-11-25 18:56:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2021-11-25 18:56:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2204. [2021-11-25 18:56:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 2194 states have (on average 2.2452142206016408) internal successors, (4926), 2203 states have internal predecessors, (4926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:56:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 4926 transitions. [2021-11-25 18:56:16,370 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 4926 transitions. Word has length 20 [2021-11-25 18:56:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:56:16,371 INFO L470 AbstractCegarLoop]: Abstraction has 2204 states and 4926 transitions. [2021-11-25 18:56:16,371 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 18:56:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 4926 transitions. [2021-11-25 18:56:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:56:16,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:56:16,372 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 18:56:16,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-25 18:56:16,372 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 18:56:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:56:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2092271194, now seen corresponding path program 7 times [2021-11-25 18:56:16,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:56:16,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388463517] [2021-11-25 18:56:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:56:16,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:56:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:17,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 18:56:17,826 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:56:17,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388463517] [2021-11-25 18:56:17,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388463517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:56:17,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:56:17,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:56:17,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332696572] [2021-11-25 18:56:17,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:56:17,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:56:17,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:56:17,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:56:17,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:56:17,827 INFO L87 Difference]: Start difference. First operand 2204 states and 4926 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 18:56:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:56:25,818 INFO L93 Difference]: Finished difference Result 3422 states and 7603 transitions. [2021-11-25 18:56:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 18:56:25,824 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 18:56:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:56:25,827 INFO L225 Difference]: With dead ends: 3422 [2021-11-25 18:56:25,828 INFO L226 Difference]: Without dead ends: 3422 [2021-11-25 18:56:25,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=491, Invalid=2161, Unknown=0, NotChecked=0, Total=2652 [2021-11-25 18:56:25,828 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 781 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 5289 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 5289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:56:25,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [781 Valid, 39 Invalid, 5374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 5289 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2021-11-25 18:56:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2021-11-25 18:56:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 2197. [2021-11-25 18:56:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2197 states, 2187 states have (on average 2.24188385916781) internal successors, (4903), 2196 states have internal predecessors, (4903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:56:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 4903 transitions. [2021-11-25 18:56:25,858 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 4903 transitions. Word has length 20 [2021-11-25 18:56:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:56:25,858 INFO L470 AbstractCegarLoop]: Abstraction has 2197 states and 4903 transitions. [2021-11-25 18:56:25,858 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 18:56:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 4903 transitions. [2021-11-25 18:56:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:56:25,860 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:56:25,860 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 18:56:25,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-25 18:56:25,860 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:56:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:56:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1977530974, now seen corresponding path program 8 times [2021-11-25 18:56:25,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:56:25,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889906745] [2021-11-25 18:56:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:56:25,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:56:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:27,400 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 18:56:27,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:56:27,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889906745] [2021-11-25 18:56:27,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889906745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:56:27,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:56:27,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 18:56:27,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382518950] [2021-11-25 18:56:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:56:27,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:56:27,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:56:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:56:27,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:56:27,401 INFO L87 Difference]: Start difference. First operand 2197 states and 4903 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 18:56:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:56:33,447 INFO L93 Difference]: Finished difference Result 3297 states and 7274 transitions. [2021-11-25 18:56:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:56:33,448 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 18:56:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:56:33,453 INFO L225 Difference]: With dead ends: 3297 [2021-11-25 18:56:33,453 INFO L226 Difference]: Without dead ends: 3297 [2021-11-25 18:56:33,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:56:33,453 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 772 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 5497 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 5497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:56:33,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 65 Invalid, 5556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 5497 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-11-25 18:56:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2021-11-25 18:56:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2150. [2021-11-25 18:56:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 2140 states have (on average 2.2336448598130842) internal successors, (4780), 2149 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:56:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 4780 transitions. [2021-11-25 18:56:33,495 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 4780 transitions. Word has length 20 [2021-11-25 18:56:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:56:33,495 INFO L470 AbstractCegarLoop]: Abstraction has 2150 states and 4780 transitions. [2021-11-25 18:56:33,495 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 18:56:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 4780 transitions. [2021-11-25 18:56:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:56:33,497 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:56:33,497 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 18:56:33,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-25 18:56:33,498 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:56:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:56:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1019437688, now seen corresponding path program 9 times [2021-11-25 18:56:33,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:56:33,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347717189] [2021-11-25 18:56:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:56:33,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:56:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:34,257 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 18:56:34,257 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:56:34,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347717189] [2021-11-25 18:56:34,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347717189] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:56:34,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:56:34,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 18:56:34,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488477253] [2021-11-25 18:56:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:56:34,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:56:34,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:56:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:56:34,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:56:34,258 INFO L87 Difference]: Start difference. First operand 2150 states and 4780 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 18:56:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:56:38,950 INFO L93 Difference]: Finished difference Result 3354 states and 7471 transitions. [2021-11-25 18:56:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 18:56:38,951 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 18:56:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:56:38,954 INFO L225 Difference]: With dead ends: 3354 [2021-11-25 18:56:38,955 INFO L226 Difference]: Without dead ends: 3354 [2021-11-25 18:56:38,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=372, Invalid=1608, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:56:38,955 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 617 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 4592 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:56:38,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 37 Invalid, 4661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4592 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-11-25 18:56:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2021-11-25 18:56:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 2150. [2021-11-25 18:56:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 2140 states have (on average 2.2336448598130842) internal successors, (4780), 2149 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:56:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 4780 transitions. [2021-11-25 18:56:38,981 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 4780 transitions. Word has length 20 [2021-11-25 18:56:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:56:38,981 INFO L470 AbstractCegarLoop]: Abstraction has 2150 states and 4780 transitions. [2021-11-25 18:56:38,981 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 18:56:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 4780 transitions. [2021-11-25 18:56:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:56:38,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:56:38,982 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 18:56:38,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-25 18:56:38,983 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 18:56:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:56:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1882185507, now seen corresponding path program 4 times [2021-11-25 18:56:38,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:56:38,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141609283] [2021-11-25 18:56:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:56:38,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:56:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:39,275 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 18:56:39,275 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:56:39,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141609283] [2021-11-25 18:56:39,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141609283] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:56:39,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619954597] [2021-11-25 18:56:39,275 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:56:39,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:56:39,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:56:39,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:56:39,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:56:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:39,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 126 conjunts are in the unsatisfiable core [2021-11-25 18:56:39,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:56:39,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,777 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 18:56:39,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,792 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 18:56:39,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,802 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 18:56:39,823 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 18:56:39,823 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 18:56:39,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:39,833 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 18:56:40,223 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 18:56:40,393 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:56:40,394 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 18:56:40,401 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-25 18:56:40,402 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 18:56:40,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:56:40,549 INFO L354 Elim1Store]: treesize reduction 92, result has 15.6 percent of original size [2021-11-25 18:56:40,550 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 41 [2021-11-25 18:56:40,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:56:40,742 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 18:56:40,747 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 18:56:40,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:56:40,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7191 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_7191) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:56:40,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7191 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_7191) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:56:40,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7191 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (let ((.cse0 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0)) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0)))) v_ArrVal_7191) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:56:40,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7191 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (let ((.cse0 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) 12))) v_ArrVal_7191) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:56:40,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7191 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (let ((.cse0 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse0) 12))) v_ArrVal_7191) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:56:40,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7191 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (let ((.cse0 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse0) 12))) v_ArrVal_7191) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2021-11-25 18:56:40,862 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 18:56:40,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619954597] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:56:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2140757493] [2021-11-25 18:56:40,863 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 18:56:40,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:56:40,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 31 [2021-11-25 18:56:40,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119766570] [2021-11-25 18:56:40,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:56:40,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 18:56:40,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:56:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 18:56:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=588, Unknown=6, NotChecked=330, Total=1056 [2021-11-25 18:56:40,865 INFO L87 Difference]: Start difference. First operand 2150 states and 4780 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 18:56:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:56:46,399 INFO L93 Difference]: Finished difference Result 4634 states and 10334 transitions. [2021-11-25 18:56:46,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-25 18:56:46,399 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 20 [2021-11-25 18:56:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:56:46,404 INFO L225 Difference]: With dead ends: 4634 [2021-11-25 18:56:46,404 INFO L226 Difference]: Without dead ends: 4634 [2021-11-25 18:56:46,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=735, Invalid=3315, Unknown=6, NotChecked=774, Total=4830 [2021-11-25 18:56:46,405 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 2221 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 4995 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2221 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3254 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:56:46,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2221 Valid, 47 Invalid, 8342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4995 Invalid, 0 Unknown, 3254 Unchecked, 3.4s Time] [2021-11-25 18:56:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2021-11-25 18:56:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 2153. [2021-11-25 18:56:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2153 states, 2143 states have (on average 2.2333177788147456) internal successors, (4786), 2152 states have internal predecessors, (4786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:56:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 4786 transitions. [2021-11-25 18:56:46,455 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 4786 transitions. Word has length 20 [2021-11-25 18:56:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:56:46,456 INFO L470 AbstractCegarLoop]: Abstraction has 2153 states and 4786 transitions. [2021-11-25 18:56:46,456 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 18:56:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 4786 transitions. [2021-11-25 18:56:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:56:46,458 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:56:46,458 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 18:56:46,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:56:46,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2021-11-25 18:56:46,679 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 18:56:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:56:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash 548013884, now seen corresponding path program 10 times [2021-11-25 18:56:46,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:56:46,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208866354] [2021-11-25 18:56:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:56:46,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:56:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:49,187 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 18:56:49,187 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:56:49,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208866354] [2021-11-25 18:56:49,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208866354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:56:49,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:56:49,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:56:49,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834750342] [2021-11-25 18:56:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:56:49,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:56:49,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:56:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:56:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:56:49,189 INFO L87 Difference]: Start difference. First operand 2153 states and 4786 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 18:56:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:56:57,184 INFO L93 Difference]: Finished difference Result 3236 states and 7083 transitions. [2021-11-25 18:56:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 18:56:57,184 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 18:56:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:56:57,187 INFO L225 Difference]: With dead ends: 3236 [2021-11-25 18:56:57,188 INFO L226 Difference]: Without dead ends: 3236 [2021-11-25 18:56:57,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=427, Invalid=1735, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 18:56:57,188 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 759 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 6173 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 6173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:56:57,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 77 Invalid, 6230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 6173 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2021-11-25 18:56:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2021-11-25 18:56:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 2238. [2021-11-25 18:56:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 2228 states have (on average 2.2392280071813286) internal successors, (4989), 2237 states have internal predecessors, (4989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:56:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 4989 transitions. [2021-11-25 18:56:57,214 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 4989 transitions. Word has length 20 [2021-11-25 18:56:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:56:57,214 INFO L470 AbstractCegarLoop]: Abstraction has 2238 states and 4989 transitions. [2021-11-25 18:56:57,214 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 18:56:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 4989 transitions. [2021-11-25 18:56:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:56:57,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:56:57,215 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 18:56:57,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-25 18:56:57,215 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:56:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:56:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash -526971828, now seen corresponding path program 11 times [2021-11-25 18:56:57,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:56:57,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585638567] [2021-11-25 18:56:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:56:57,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:56:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:56:59,195 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 18:56:59,195 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:56:59,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585638567] [2021-11-25 18:56:59,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585638567] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:56:59,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:56:59,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:56:59,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809586857] [2021-11-25 18:56:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:56:59,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:56:59,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:56:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:56:59,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:56:59,197 INFO L87 Difference]: Start difference. First operand 2238 states and 4989 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 18:57:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:04,007 INFO L93 Difference]: Finished difference Result 3164 states and 6965 transitions. [2021-11-25 18:57:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 18:57:04,008 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 18:57:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:04,011 INFO L225 Difference]: With dead ends: 3164 [2021-11-25 18:57:04,011 INFO L226 Difference]: Without dead ends: 3164 [2021-11-25 18:57:04,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=368, Invalid=1612, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 18:57:04,011 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 728 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 4755 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:04,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 47 Invalid, 4804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4755 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-11-25 18:57:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2021-11-25 18:57:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2283. [2021-11-25 18:57:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2273 states have (on average 2.2375714914210296) internal successors, (5086), 2282 states have internal predecessors, (5086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:57:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 5086 transitions. [2021-11-25 18:57:04,038 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 5086 transitions. Word has length 20 [2021-11-25 18:57:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:04,039 INFO L470 AbstractCegarLoop]: Abstraction has 2283 states and 5086 transitions. [2021-11-25 18:57:04,039 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 18:57:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 5086 transitions. [2021-11-25 18:57:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:57:04,040 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:04,040 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 18:57:04,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-11-25 18:57:04,041 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:57:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1779649258, now seen corresponding path program 12 times [2021-11-25 18:57:04,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:04,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293073847] [2021-11-25 18:57:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:04,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:05,792 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 18:57:05,792 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:05,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293073847] [2021-11-25 18:57:05,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293073847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:05,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:05,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:57:05,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108008629] [2021-11-25 18:57:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:05,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:57:05,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:05,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:57:05,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:57:05,794 INFO L87 Difference]: Start difference. First operand 2283 states and 5086 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 18:57:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:11,985 INFO L93 Difference]: Finished difference Result 3301 states and 7264 transitions. [2021-11-25 18:57:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:57:11,986 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 18:57:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:11,989 INFO L225 Difference]: With dead ends: 3301 [2021-11-25 18:57:11,989 INFO L226 Difference]: Without dead ends: 3301 [2021-11-25 18:57:11,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=447, Invalid=1715, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 18:57:11,990 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 832 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 4337 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:11,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [832 Valid, 45 Invalid, 4388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4337 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-11-25 18:57:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2021-11-25 18:57:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 2284. [2021-11-25 18:57:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2274 states have (on average 2.237467018469657) internal successors, (5088), 2283 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:57:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 5088 transitions. [2021-11-25 18:57:12,017 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 5088 transitions. Word has length 20 [2021-11-25 18:57:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:12,017 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 5088 transitions. [2021-11-25 18:57:12,017 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 18:57:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 5088 transitions. [2021-11-25 18:57:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:57:12,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:12,019 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 18:57:12,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-11-25 18:57:12,019 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:57:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1670706936, now seen corresponding path program 13 times [2021-11-25 18:57:12,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:12,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149012192] [2021-11-25 18:57:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:12,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:14,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 18:57:14,330 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:14,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149012192] [2021-11-25 18:57:14,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149012192] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:14,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:14,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:57:14,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508476175] [2021-11-25 18:57:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:14,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:57:14,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:57:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:57:14,331 INFO L87 Difference]: Start difference. First operand 2284 states and 5088 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 18:57:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:20,703 INFO L93 Difference]: Finished difference Result 3198 states and 7033 transitions. [2021-11-25 18:57:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:57:20,703 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 18:57:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:20,707 INFO L225 Difference]: With dead ends: 3198 [2021-11-25 18:57:20,707 INFO L226 Difference]: Without dead ends: 3198 [2021-11-25 18:57:20,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=400, Invalid=1670, Unknown=0, NotChecked=0, Total=2070 [2021-11-25 18:57:20,707 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 933 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 4245 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:20,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 43 Invalid, 4314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4245 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-25 18:57:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2021-11-25 18:57:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 2237. [2021-11-25 18:57:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2227 states have (on average 2.2388863942523574) internal successors, (4986), 2236 states have internal predecessors, (4986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:57:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 4986 transitions. [2021-11-25 18:57:20,735 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 4986 transitions. Word has length 20 [2021-11-25 18:57:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:20,735 INFO L470 AbstractCegarLoop]: Abstraction has 2237 states and 4986 transitions. [2021-11-25 18:57:20,735 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 18:57:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 4986 transitions. [2021-11-25 18:57:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:57:20,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:20,737 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 18:57:20,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-11-25 18:57:20,737 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:57:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash 447566388, now seen corresponding path program 14 times [2021-11-25 18:57:20,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909464843] [2021-11-25 18:57:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:20,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:22,347 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 18:57:22,348 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:22,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909464843] [2021-11-25 18:57:22,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909464843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:22,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:22,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:57:22,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468436464] [2021-11-25 18:57:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:22,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:57:22,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:22,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:57:22,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:57:22,349 INFO L87 Difference]: Start difference. First operand 2237 states and 4986 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 18:57:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:27,011 INFO L93 Difference]: Finished difference Result 2952 states and 6517 transitions. [2021-11-25 18:57:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 18:57:27,011 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 18:57:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:27,015 INFO L225 Difference]: With dead ends: 2952 [2021-11-25 18:57:27,015 INFO L226 Difference]: Without dead ends: 2952 [2021-11-25 18:57:27,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=308, Invalid=1332, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 18:57:27,015 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 610 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:27,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [610 Valid, 43 Invalid, 4324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4273 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-25 18:57:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2021-11-25 18:57:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 2287. [2021-11-25 18:57:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 2277 states have (on average 2.240228370663153) internal successors, (5101), 2286 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 18:57:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 5101 transitions. [2021-11-25 18:57:27,042 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 5101 transitions. Word has length 20 [2021-11-25 18:57:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:27,042 INFO L470 AbstractCegarLoop]: Abstraction has 2287 states and 5101 transitions. [2021-11-25 18:57:27,042 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 18:57:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 5101 transitions. [2021-11-25 18:57:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:57:27,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:27,044 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 18:57:27,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-11-25 18:57:27,044 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 18:57:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1840920808, now seen corresponding path program 15 times [2021-11-25 18:57:27,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:27,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607635703] [2021-11-25 18:57:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:27,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:27,984 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 18:57:27,984 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:27,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607635703] [2021-11-25 18:57:27,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607635703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:27,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:27,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:57:27,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099669481] [2021-11-25 18:57:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:27,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:57:27,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:57:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:57:27,985 INFO L87 Difference]: Start difference. First operand 2287 states and 5101 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 18:57:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:33,414 INFO L93 Difference]: Finished difference Result 3709 states and 8169 transitions. [2021-11-25 18:57:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:57:33,414 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 18:57:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:33,418 INFO L225 Difference]: With dead ends: 3709 [2021-11-25 18:57:33,418 INFO L226 Difference]: Without dead ends: 3709 [2021-11-25 18:57:33,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=336, Invalid=1470, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 18:57:33,419 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 637 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 6106 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 6106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:33,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 53 Invalid, 6160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 6106 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2021-11-25 18:57:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2021-11-25 18:57:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 2330. [2021-11-25 18:57:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2320 states have (on average 2.2392241379310347) internal successors, (5195), 2329 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 18:57:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 5195 transitions. [2021-11-25 18:57:33,447 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 5195 transitions. Word has length 20 [2021-11-25 18:57:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:33,448 INFO L470 AbstractCegarLoop]: Abstraction has 2330 states and 5195 transitions. [2021-11-25 18:57:33,448 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 18:57:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 5195 transitions. [2021-11-25 18:57:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:57:33,449 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:33,449 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 18:57:33,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-11-25 18:57:33,449 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 18:57:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash 765935096, now seen corresponding path program 16 times [2021-11-25 18:57:33,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:33,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796459964] [2021-11-25 18:57:33,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:33,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:34,892 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 18:57:34,892 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:34,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796459964] [2021-11-25 18:57:34,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796459964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:34,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:34,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 18:57:34,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398489754] [2021-11-25 18:57:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:34,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:57:34,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:57:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:57:34,894 INFO L87 Difference]: Start difference. First operand 2330 states and 5195 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 18:57:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:38,521 INFO L93 Difference]: Finished difference Result 3942 states and 8762 transitions. [2021-11-25 18:57:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 18:57:38,522 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 18:57:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:38,526 INFO L225 Difference]: With dead ends: 3942 [2021-11-25 18:57:38,526 INFO L226 Difference]: Without dead ends: 3942 [2021-11-25 18:57:38,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=290, Invalid=1116, Unknown=0, NotChecked=0, Total=1406 [2021-11-25 18:57:38,526 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 825 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 3332 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:38,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 43 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3332 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 18:57:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2021-11-25 18:57:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 2340. [2021-11-25 18:57:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2330 states have (on average 2.23862660944206) internal successors, (5216), 2339 states have internal predecessors, (5216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:57:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 5216 transitions. [2021-11-25 18:57:38,557 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 5216 transitions. Word has length 20 [2021-11-25 18:57:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:38,557 INFO L470 AbstractCegarLoop]: Abstraction has 2340 states and 5216 transitions. [2021-11-25 18:57:38,557 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 18:57:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 5216 transitions. [2021-11-25 18:57:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:57:38,559 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:38,559 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 18:57:38,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-11-25 18:57:38,559 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 18:57:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1222411114, now seen corresponding path program 17 times [2021-11-25 18:57:38,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:38,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000269335] [2021-11-25 18:57:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:38,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:40,211 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 18:57:40,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000269335] [2021-11-25 18:57:40,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000269335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:40,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:40,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 18:57:40,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497876882] [2021-11-25 18:57:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:40,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:57:40,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:40,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:57:40,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:57:40,213 INFO L87 Difference]: Start difference. First operand 2340 states and 5216 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 18:57:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:46,268 INFO L93 Difference]: Finished difference Result 3407 states and 7566 transitions. [2021-11-25 18:57:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 18:57:46,268 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 18:57:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:46,272 INFO L225 Difference]: With dead ends: 3407 [2021-11-25 18:57:46,272 INFO L226 Difference]: Without dead ends: 3407 [2021-11-25 18:57:46,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=414, Invalid=1478, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 18:57:46,272 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 736 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 4174 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:46,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [736 Valid, 41 Invalid, 4232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 4174 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-25 18:57:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2021-11-25 18:57:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 2355. [2021-11-25 18:57:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2345 states have (on average 2.2383795309168444) internal successors, (5249), 2354 states have internal predecessors, (5249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:57:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 5249 transitions. [2021-11-25 18:57:46,300 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 5249 transitions. Word has length 20 [2021-11-25 18:57:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:46,300 INFO L470 AbstractCegarLoop]: Abstraction has 2355 states and 5249 transitions. [2021-11-25 18:57:46,300 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 18:57:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 5249 transitions. [2021-11-25 18:57:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:57:46,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:46,301 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 18:57:46,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-11-25 18:57:46,301 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 18:57:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1331353436, now seen corresponding path program 18 times [2021-11-25 18:57:46,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:46,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720415874] [2021-11-25 18:57:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:46,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:47,240 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 18:57:47,240 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:47,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720415874] [2021-11-25 18:57:47,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720415874] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:47,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:47,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-25 18:57:47,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873795753] [2021-11-25 18:57:47,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:47,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 18:57:47,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:47,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 18:57:47,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:57:47,241 INFO L87 Difference]: Start difference. First operand 2355 states and 5249 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 18:57:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:52,677 INFO L93 Difference]: Finished difference Result 3755 states and 8303 transitions. [2021-11-25 18:57:52,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 18:57:52,677 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 18:57:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:52,681 INFO L225 Difference]: With dead ends: 3755 [2021-11-25 18:57:52,681 INFO L226 Difference]: Without dead ends: 3755 [2021-11-25 18:57:52,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=346, Invalid=1376, Unknown=0, NotChecked=0, Total=1722 [2021-11-25 18:57:52,682 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 855 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 5430 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 5496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 5430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:52,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 75 Invalid, 5496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 5430 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-11-25 18:57:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2021-11-25 18:57:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 2195. [2021-11-25 18:57:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2195 states, 2185 states have (on average 2.2352402745995423) internal successors, (4884), 2194 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:57:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4884 transitions. [2021-11-25 18:57:52,710 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4884 transitions. Word has length 20 [2021-11-25 18:57:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:52,710 INFO L470 AbstractCegarLoop]: Abstraction has 2195 states and 4884 transitions. [2021-11-25 18:57:52,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 18:57:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4884 transitions. [2021-11-25 18:57:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:57:52,712 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:52,712 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 18:57:52,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-11-25 18:57:52,712 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:57:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1432479831, now seen corresponding path program 1 times [2021-11-25 18:57:52,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:52,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480550204] [2021-11-25 18:57:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:52,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:53,103 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 18:57:53,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:53,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480550204] [2021-11-25 18:57:53,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480550204] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:53,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:53,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:57:53,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599716223] [2021-11-25 18:57:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:53,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:57:53,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:53,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:57:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:57:53,104 INFO L87 Difference]: Start difference. First operand 2195 states and 4884 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 18:57:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:54,597 INFO L93 Difference]: Finished difference Result 2627 states and 5722 transitions. [2021-11-25 18:57:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:57:54,598 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 18:57:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:54,602 INFO L225 Difference]: With dead ends: 2627 [2021-11-25 18:57:54,603 INFO L226 Difference]: Without dead ends: 2566 [2021-11-25 18:57:54,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:57:54,603 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 260 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:54,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 37 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:57:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2021-11-25 18:57:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2236. [2021-11-25 18:57:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2226 states have (on average 2.234052111410602) internal successors, (4973), 2235 states have internal predecessors, (4973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:57:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 4973 transitions. [2021-11-25 18:57:54,628 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 4973 transitions. Word has length 21 [2021-11-25 18:57:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:54,629 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 4973 transitions. [2021-11-25 18:57:54,629 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 18:57:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 4973 transitions. [2021-11-25 18:57:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:57:54,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:54,630 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 18:57:54,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-11-25 18:57:54,630 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:57:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1346160303, now seen corresponding path program 2 times [2021-11-25 18:57:54,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:54,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453333955] [2021-11-25 18:57:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:54,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:54,739 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 18:57:54,739 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:54,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453333955] [2021-11-25 18:57:54,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453333955] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:54,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:54,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 18:57:54,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654199449] [2021-11-25 18:57:54,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:54,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:57:54,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:54,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:57:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:57:54,741 INFO L87 Difference]: Start difference. First operand 2236 states and 4973 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 18:57:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:57:55,470 INFO L93 Difference]: Finished difference Result 3383 states and 7489 transitions. [2021-11-25 18:57:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:57:55,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 18:57:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:57:55,476 INFO L225 Difference]: With dead ends: 3383 [2021-11-25 18:57:55,476 INFO L226 Difference]: Without dead ends: 3255 [2021-11-25 18:57:55,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:57:55,477 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 364 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:57:55,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 45 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:57:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-11-25 18:57:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 2472. [2021-11-25 18:57:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2462 states have (on average 2.2652315190901704) internal successors, (5577), 2471 states have internal predecessors, (5577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:57:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 5577 transitions. [2021-11-25 18:57:55,515 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 5577 transitions. Word has length 21 [2021-11-25 18:57:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:57:55,515 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 5577 transitions. [2021-11-25 18:57:55,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 18:57:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 5577 transitions. [2021-11-25 18:57:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:57:55,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:57:55,518 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 18:57:55,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-11-25 18:57:55,518 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 18:57:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:57:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash -191335009, now seen corresponding path program 1 times [2021-11-25 18:57:55,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:57:55,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850600241] [2021-11-25 18:57:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:57:55,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:57:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:57:57,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 18:57:57,333 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:57:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850600241] [2021-11-25 18:57:57,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850600241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:57:57,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:57:57,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 18:57:57,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746781873] [2021-11-25 18:57:57,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:57:57,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:57:57,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:57:57,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:57:57,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:57:57,334 INFO L87 Difference]: Start difference. First operand 2472 states and 5577 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 18:58:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:03,517 INFO L93 Difference]: Finished difference Result 3828 states and 8520 transitions. [2021-11-25 18:58:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 18:58:03,518 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 18:58:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:03,523 INFO L225 Difference]: With dead ends: 3828 [2021-11-25 18:58:03,523 INFO L226 Difference]: Without dead ends: 3828 [2021-11-25 18:58:03,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=438, Invalid=1724, Unknown=0, NotChecked=0, Total=2162 [2021-11-25 18:58:03,523 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 757 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 5688 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 5688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:03,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [757 Valid, 51 Invalid, 5760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 5688 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-11-25 18:58:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2021-11-25 18:58:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 2448. [2021-11-25 18:58:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2438 states have (on average 2.263740771123872) internal successors, (5519), 2447 states have internal predecessors, (5519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 5519 transitions. [2021-11-25 18:58:03,553 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 5519 transitions. Word has length 21 [2021-11-25 18:58:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:03,553 INFO L470 AbstractCegarLoop]: Abstraction has 2448 states and 5519 transitions. [2021-11-25 18:58:03,553 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 18:58:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 5519 transitions. [2021-11-25 18:58:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:58:03,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:03,555 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 18:58:03,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-11-25 18:58:03,555 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 18:58:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash 515658899, now seen corresponding path program 3 times [2021-11-25 18:58:03,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917694406] [2021-11-25 18:58:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:03,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:04,027 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 18:58:04,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:04,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917694406] [2021-11-25 18:58:04,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917694406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:04,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:04,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:58:04,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679287461] [2021-11-25 18:58:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:04,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:58:04,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:58:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:58:04,029 INFO L87 Difference]: Start difference. First operand 2448 states and 5519 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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 18:58:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:05,842 INFO L93 Difference]: Finished difference Result 2829 states and 6290 transitions. [2021-11-25 18:58:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 18:58:05,843 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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 18:58:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:05,847 INFO L225 Difference]: With dead ends: 2829 [2021-11-25 18:58:05,847 INFO L226 Difference]: Without dead ends: 2829 [2021-11-25 18:58:05,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2021-11-25 18:58:05,847 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 273 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:05,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 30 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 18:58:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2021-11-25 18:58:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2469. [2021-11-25 18:58:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2459 states have (on average 2.265555103700691) internal successors, (5571), 2468 states have internal predecessors, (5571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 5571 transitions. [2021-11-25 18:58:05,875 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 5571 transitions. Word has length 21 [2021-11-25 18:58:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:05,875 INFO L470 AbstractCegarLoop]: Abstraction has 2469 states and 5571 transitions. [2021-11-25 18:58:05,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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 18:58:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 5571 transitions. [2021-11-25 18:58:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:58:05,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:05,877 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 18:58:05,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-11-25 18:58:05,877 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 18:58:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1550840195, now seen corresponding path program 4 times [2021-11-25 18:58:05,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:05,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157063868] [2021-11-25 18:58:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:05,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:06,202 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 18:58:06,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:06,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157063868] [2021-11-25 18:58:06,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157063868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:06,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:06,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 18:58:06,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85966276] [2021-11-25 18:58:06,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:06,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:58:06,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:58:06,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:58:06,203 INFO L87 Difference]: Start difference. First operand 2469 states and 5571 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 18:58:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:07,971 INFO L93 Difference]: Finished difference Result 2910 states and 6458 transitions. [2021-11-25 18:58:07,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 18:58:07,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 18:58:07,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:07,975 INFO L225 Difference]: With dead ends: 2910 [2021-11-25 18:58:07,975 INFO L226 Difference]: Without dead ends: 2910 [2021-11-25 18:58:07,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:58:07,976 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 265 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:07,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 30 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 18:58:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2021-11-25 18:58:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2490. [2021-11-25 18:58:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2480 states have (on average 2.264516129032258) internal successors, (5616), 2489 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 5616 transitions. [2021-11-25 18:58:08,012 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 5616 transitions. Word has length 21 [2021-11-25 18:58:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:08,012 INFO L470 AbstractCegarLoop]: Abstraction has 2490 states and 5616 transitions. [2021-11-25 18:58:08,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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 18:58:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 5616 transitions. [2021-11-25 18:58:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:58:08,013 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:08,013 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 18:58:08,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-11-25 18:58:08,014 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 18:58:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash -665344079, now seen corresponding path program 2 times [2021-11-25 18:58:08,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:08,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724462558] [2021-11-25 18:58:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:08,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:09,704 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 18:58:09,704 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:09,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724462558] [2021-11-25 18:58:09,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724462558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:09,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:09,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 18:58:09,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258495114] [2021-11-25 18:58:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:09,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:58:09,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:58:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:58:09,706 INFO L87 Difference]: Start difference. First operand 2490 states and 5616 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 18:58:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:16,467 INFO L93 Difference]: Finished difference Result 4020 states and 8997 transitions. [2021-11-25 18:58:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-25 18:58:16,467 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 18:58:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:16,472 INFO L225 Difference]: With dead ends: 4020 [2021-11-25 18:58:16,472 INFO L226 Difference]: Without dead ends: 4020 [2021-11-25 18:58:16,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=486, Invalid=1770, Unknown=0, NotChecked=0, Total=2256 [2021-11-25 18:58:16,474 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 831 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 5942 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 5942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:16,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [831 Valid, 51 Invalid, 5994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 5942 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-11-25 18:58:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2021-11-25 18:58:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 2505. [2021-11-25 18:58:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2495 states have (on average 2.264128256513026) internal successors, (5649), 2504 states have internal predecessors, (5649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 5649 transitions. [2021-11-25 18:58:16,506 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 5649 transitions. Word has length 21 [2021-11-25 18:58:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:16,506 INFO L470 AbstractCegarLoop]: Abstraction has 2505 states and 5649 transitions. [2021-11-25 18:58:16,506 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 18:58:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 5649 transitions. [2021-11-25 18:58:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:58:16,507 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:16,507 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 18:58:16,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-11-25 18:58:16,508 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 18:58:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash 41649829, now seen corresponding path program 5 times [2021-11-25 18:58:16,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:16,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032756147] [2021-11-25 18:58:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:16,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:16,916 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 18:58:16,916 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:16,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032756147] [2021-11-25 18:58:16,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032756147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:16,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:16,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:58:16,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764130443] [2021-11-25 18:58:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:16,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:58:16,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:58:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:58:16,917 INFO L87 Difference]: Start difference. First operand 2505 states and 5649 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 18:58:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:18,871 INFO L93 Difference]: Finished difference Result 3212 states and 7119 transitions. [2021-11-25 18:58:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 18:58:18,872 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 18:58:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:18,879 INFO L225 Difference]: With dead ends: 3212 [2021-11-25 18:58:18,879 INFO L226 Difference]: Without dead ends: 3153 [2021-11-25 18:58:18,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:58:18,880 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 400 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:18,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 34 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:58:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2021-11-25 18:58:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2496. [2021-11-25 18:58:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2486 states have (on average 2.263475462590507) internal successors, (5627), 2495 states have internal predecessors, (5627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 5627 transitions. [2021-11-25 18:58:18,926 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 5627 transitions. Word has length 21 [2021-11-25 18:58:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:18,926 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 5627 transitions. [2021-11-25 18:58:18,926 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 18:58:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 5627 transitions. [2021-11-25 18:58:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:58:18,930 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:18,931 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 18:58:18,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-11-25 18:58:18,931 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 18:58:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash 252411235, now seen corresponding path program 3 times [2021-11-25 18:58:18,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:18,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358696246] [2021-11-25 18:58:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:18,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:20,932 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 18:58:20,932 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:20,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358696246] [2021-11-25 18:58:20,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358696246] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:20,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:20,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-25 18:58:20,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644860784] [2021-11-25 18:58:20,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:20,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 18:58:20,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 18:58:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:58:20,933 INFO L87 Difference]: Start difference. First operand 2496 states and 5627 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 18:58:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:27,024 INFO L93 Difference]: Finished difference Result 3991 states and 8936 transitions. [2021-11-25 18:58:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-25 18:58:27,024 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 18:58:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:27,031 INFO L225 Difference]: With dead ends: 3991 [2021-11-25 18:58:27,032 INFO L226 Difference]: Without dead ends: 3991 [2021-11-25 18:58:27,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=422, Invalid=1648, Unknown=0, NotChecked=0, Total=2070 [2021-11-25 18:58:27,032 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 815 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 5301 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 5301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:27,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [815 Valid, 49 Invalid, 5349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 5301 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-11-25 18:58:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3991 states. [2021-11-25 18:58:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3991 to 2490. [2021-11-25 18:58:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2480 states have (on average 2.263709677419355) internal successors, (5614), 2489 states have internal predecessors, (5614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 5614 transitions. [2021-11-25 18:58:27,082 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 5614 transitions. Word has length 21 [2021-11-25 18:58:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:27,083 INFO L470 AbstractCegarLoop]: Abstraction has 2490 states and 5614 transitions. [2021-11-25 18:58:27,083 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 18:58:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 5614 transitions. [2021-11-25 18:58:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:58:27,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:27,085 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 18:58:27,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-11-25 18:58:27,085 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 18:58:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash 757526759, now seen corresponding path program 4 times [2021-11-25 18:58:27,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:27,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522695870] [2021-11-25 18:58:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:27,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:27,670 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 18:58:27,670 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:27,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522695870] [2021-11-25 18:58:27,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522695870] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:27,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:27,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 18:58:27,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64991549] [2021-11-25 18:58:27,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:27,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 18:58:27,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 18:58:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:58:27,671 INFO L87 Difference]: Start difference. First operand 2490 states and 5614 transitions. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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 18:58:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:31,690 INFO L93 Difference]: Finished difference Result 4082 states and 9131 transitions. [2021-11-25 18:58:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 18:58:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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 18:58:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:31,695 INFO L225 Difference]: With dead ends: 4082 [2021-11-25 18:58:31,695 INFO L226 Difference]: Without dead ends: 4082 [2021-11-25 18:58:31,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=427, Invalid=1379, Unknown=0, NotChecked=0, Total=1806 [2021-11-25 18:58:31,696 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 867 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:31,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [867 Valid, 43 Invalid, 3503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 18:58:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2021-11-25 18:58:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 2397. [2021-11-25 18:58:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2387 states have (on average 2.2576455802262254) internal successors, (5389), 2396 states have internal predecessors, (5389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 5389 transitions. [2021-11-25 18:58:31,727 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 5389 transitions. Word has length 21 [2021-11-25 18:58:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:31,727 INFO L470 AbstractCegarLoop]: Abstraction has 2397 states and 5389 transitions. [2021-11-25 18:58:31,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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 18:58:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 5389 transitions. [2021-11-25 18:58:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:58:31,728 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:31,728 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 18:58:31,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-11-25 18:58:31,728 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:58:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2121341542, now seen corresponding path program 1 times [2021-11-25 18:58:31,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:31,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337924717] [2021-11-25 18:58:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:31,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:32,272 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 18:58:32,272 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:32,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337924717] [2021-11-25 18:58:32,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337924717] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:58:32,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393627766] [2021-11-25 18:58:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:32,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:58:32,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:58:32,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:58:32,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:58:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:32,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 148 conjunts are in the unsatisfiable core [2021-11-25 18:58:32,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:58:32,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:32,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:32,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:32,838 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 40 treesize of output 44 [2021-11-25 18:58:32,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:32,845 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 34 treesize of output 30 [2021-11-25 18:58:32,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:32,850 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 18:58:32,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:32,858 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 18:58:33,294 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 18:58:33,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:58:33,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:33,510 INFO L354 Elim1Store]: treesize reduction 86, result has 38.6 percent of original size [2021-11-25 18:58:33,510 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 77 [2021-11-25 18:58:33,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:33,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:33,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 48 [2021-11-25 18:58:34,103 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 63 treesize of output 51 [2021-11-25 18:58:34,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:34,300 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-25 18:58:34,301 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 64 [2021-11-25 18:58:34,315 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 13 treesize of output 9 [2021-11-25 18:58:34,381 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:58:34,382 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 18:58:34,385 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 18:58:34,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:58:34,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2021-11-25 18:58:34,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) is different from false [2021-11-25 18:58:34,650 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:58:34,651 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 39 treesize of output 42 [2021-11-25 18:58:35,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927)))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse1) (+ 12 v_arrayElimCell_98)) .cse1))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))) is different from false [2021-11-25 18:58:35,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse0 (select (select .cse1 .cse0) (+ 12 v_arrayElimCell_98))))) (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|)))) is different from false [2021-11-25 18:58:35,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) (+ 12 .cse4)))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse2)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse3 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse3) (+ 12 v_arrayElimCell_98)) .cse3))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (and (not (= .cse4 v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))))))) is different from false [2021-11-25 18:58:36,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) (+ 12 .cse4)))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse2)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (let ((.cse3 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse3) (+ 12 v_arrayElimCell_98)) .cse3))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (and (not (= .cse4 v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))))))) is different from false [2021-11-25 18:58:37,051 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 276 treesize of output 210 [2021-11-25 18:58:37,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 Int) (v_arrayElimCell_100 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse4 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_100 12))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse1 (select (select .cse0 .cse1) .cse2))) (not (= .cse1 .cse3)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))))))) is different from false [2021-11-25 18:58:37,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 Int) (v_arrayElimCell_100 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse4 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_100 12))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (not (= .cse3 .cse1)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))))))) is different from false [2021-11-25 18:58:37,186 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 Int) (v_arrayElimCell_100 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4)) (.cse3 (+ v_arrayElimCell_100 12))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse1 .cse2)) (not (= .cse1 (select (select .cse0 .cse1) .cse3))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))))))) is different from false [2021-11-25 18:58:37,188 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 18:58:37,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393627766] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:58:37,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1047577291] [2021-11-25 18:58:37,189 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 18:58:37,189 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:58:37,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 45 [2021-11-25 18:58:37,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559583835] [2021-11-25 18:58:37,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:58:37,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-25 18:58:37,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-25 18:58:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1241, Unknown=9, NotChecked=720, Total=2162 [2021-11-25 18:58:37,191 INFO L87 Difference]: Start difference. First operand 2397 states and 5389 transitions. Second operand has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:37,417 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 .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse8 (select .cse9 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse0 4))) (not (= .cse1 0)) (forall ((v_ArrVal_8927 Int) (v_arrayElimCell_100 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse6 (+ |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|) .cse6)) (.cse5 (+ v_arrayElimCell_100 12))) (let ((.cse2 (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse6))) (or (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse3 .cse4)) (not (= .cse3 (select (select .cse2 .cse3) .cse5))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))))))) (= .cse1 .cse8) (< .cse1 |c_#StackHeapBarrier|) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse1) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse8))))) is different from false [2021-11-25 18:58:37,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse9 (select .cse11 4))) (and (forall ((v_ArrVal_8927 Int) (v_arrayElimCell_100 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse4 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_100 12))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (not (= .cse3 .cse1)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))))))) (not (= .cse6 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|))) (= (select .cse7 4) (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (not (= .cse8 0)) (= .cse6 .cse9) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (< .cse8 |c_#StackHeapBarrier|) (= (select .cse10 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse8) (not (= .cse9 |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0)))) is different from false [2021-11-25 18:58:37,425 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse1 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse11 4))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse0 4))) (= .cse1 .cse2) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse3 0)) (forall ((v_ArrVal_8927 Int) (v_arrayElimCell_100 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse8 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse8)) (.cse6 (+ v_arrayElimCell_100 12))) (let ((.cse4 (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse7) .cse6))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (let ((.cse5 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse8))) (or (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse5 (select (select .cse4 .cse5) .cse6))) (not (= .cse5 .cse7)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (< .cse3 |c_#StackHeapBarrier|) (= (select .cse10 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse3) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 18:58:37,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse12 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse1 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse13 .cse12)) (.cse3 (select .cse2 .cse12))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (not (= .cse1 0)) (= .cse0 |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse5 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse5)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse5))) (let ((.cse4 (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse6) (+ 12 .cse8)))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (not (= (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse5) .cse6)) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (let ((.cse7 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse4 .cse7) (+ 12 v_arrayElimCell_98)) .cse7))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (and (not (= .cse8 v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse10 0)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< .cse10 |c_#StackHeapBarrier|) (= (select .cse11 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse10) (not (= .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| .cse3)))) is different from false [2021-11-25 18:58:37,457 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse12 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse7 (select .cse13 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse8 (select .cse9 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse6 (select .cse13 .cse12)) (.cse11 (select .cse10 .cse12))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) (+ 12 .cse4)))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse2)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse3 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse3) (+ 12 v_arrayElimCell_98)) .cse3))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (and (not (= .cse4 v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))))))) (= .cse6 |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (= .cse6 .cse7) (= .cse8 (select .cse9 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= .cse7 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse8 0)) (< .cse8 |c_#StackHeapBarrier|) (= (select .cse10 |c_ULTIMATE.start_fifo_front_~self#1.offset|) .cse11) (not (= .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| .cse11)))) is different from false [2021-11-25 18:58:37,480 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse11 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse7 (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse6 (select .cse10 .cse11)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) (+ 12 .cse4)))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse2)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse3 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse3) (+ 12 v_arrayElimCell_98)) .cse3))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (and (not (= .cse4 v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))))))) (= .cse6 |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (= .cse6 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= .cse7 (select .cse8 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= .cse9 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= (select .cse10 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (not (= .cse7 0)) (< .cse7 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (not (= .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| .cse9)))) is different from false [2021-11-25 18:58:37,484 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse6 (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) (+ 12 .cse4)))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse2)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse3 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse3) (+ 12 v_arrayElimCell_98)) .cse3))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (and (not (= .cse4 v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))))))) (= .cse6 (select .cse7 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= .cse6 0)) (< .cse6 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 18:58:37,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse7 (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse6 (select .cse10 .cse9))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) (+ 12 .cse4)))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse2)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse3 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse3) (+ 12 v_arrayElimCell_98)) .cse3))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (and (not (= .cse4 v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))))))) (= .cse6 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= .cse7 (select .cse8 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= (select .cse10 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (not (= .cse7 0)) (< .cse7 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (not (= .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 18:58:37,532 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse3 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse2 (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse2 (select (select .cse3 .cse2) (+ 12 v_arrayElimCell_98))))) (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (not (= (select (select (store .cse3 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|)))) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 18:58:37,557 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse0 (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= .cse0 (select .cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (forall ((v_ArrVal_8927 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8930 (Array Int Int)) (v_arrayElimCell_98 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8927))))) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse3 (select (select .cse4 .cse3) (+ 12 v_arrayElimCell_98))))) (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|)))) (not (= .cse0 0)) (= (select .cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 18:58:40,454 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (exists ((v_arrayElimCell_92 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 v_arrayElimCell_92)) .cse0) (= (select .cse1 |c_ULTIMATE.start_fifo_front_~self#1.offset|) .cse0))))) (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (< .cse2 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (or (not (= (select .cse3 .cse4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= (select .cse3 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4))))) (not (= .cse2 0)))) is different from false [2021-11-25 18:58:41,477 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))))) (and (or (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) .cse0) .cse0)) is different from false [2021-11-25 18:58:41,508 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (exists ((v_arrayElimCell_92 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (= (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 v_arrayElimCell_92)) .cse0))) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< (+ .cse1 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (not (= .cse1 0)) (= (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|) .cse1)))) is different from false [2021-11-25 18:58:41,721 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (and (or (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (forall ((v_arrayElimCell_98 Int)) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)))) (let ((.cse2 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse1 .cse2) (+ 12 v_arrayElimCell_98)) .cse2))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (exists ((v_arrayElimCell_92 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse3 (select .cse4 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (and (= (select (select |c_#memory_$Pointer$.base| .cse3) (+ 12 v_arrayElimCell_92)) .cse3) (= (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.offset|) .cse3))))) (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (< .cse5 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (or (not (= (select .cse6 .cse0) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= (select .cse6 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0))))) (not (= .cse5 0)))) is different from false [2021-11-25 18:58:41,837 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) is different from false [2021-11-25 18:58:42,052 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (or (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (forall ((v_arrayElimCell_98 Int)) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)))) (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse1) (+ 12 v_arrayElimCell_98)) .cse1))))))) (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) is different from false [2021-11-25 18:58:42,056 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (or (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (forall ((v_arrayElimCell_98 Int)) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)))) (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse1) (+ 12 v_arrayElimCell_98)) .cse1))))))) (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= |c_ULTIMATE.start_fifo_front_#t~mem53#1.base| 0))) is different from false [2021-11-25 18:58:42,184 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= |c_ULTIMATE.start_fifo_front_#t~mem53#1.base| 0))) is different from false [2021-11-25 18:58:42,187 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (not (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|))) is different from false [2021-11-25 18:58:42,791 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (and (or (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| .cse0)) .cse1) .cse1 (or (not (= .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) .cse1 (forall ((v_arrayElimCell_98 Int)) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select |c_#memory_$Pointer$.base| .cse2) (+ 12 v_arrayElimCell_98)) .cse2)))))) (or .cse1 (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)) .cse0))))) is different from false [2021-11-25 18:58:42,799 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (and (or (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| .cse0)) .cse1) (or (forall ((v_ArrVal_8930 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179| v_ArrVal_8930) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_179|))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (forall ((v_arrayElimCell_98 Int)) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (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_#t~mem27#1.base|)))) (let ((.cse4 (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse3 .cse4) (+ 12 v_arrayElimCell_98)) .cse4))))))) .cse1 (or (not (= .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) .cse1 (forall ((v_arrayElimCell_98 Int)) (or (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_98)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select |c_#memory_$Pointer$.base| .cse5) (+ 12 v_arrayElimCell_98)) .cse5)))))) (or .cse1 (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)) .cse0)))))) is different from false [2021-11-25 18:58:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:45,155 INFO L93 Difference]: Finished difference Result 4864 states and 11447 transitions. [2021-11-25 18:58:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-11-25 18:58:45,155 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 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 18:58:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:45,160 INFO L225 Difference]: With dead ends: 4864 [2021-11-25 18:58:45,161 INFO L226 Difference]: Without dead ends: 4864 [2021-11-25 18:58:45,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=730, Invalid=4887, Unknown=53, NotChecked=5250, Total=10920 [2021-11-25 18:58:45,161 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 838 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 6486 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25179 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:45,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [838 Valid, 94 Invalid, 31690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6486 Invalid, 0 Unknown, 25179 Unchecked, 4.2s Time] [2021-11-25 18:58:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2021-11-25 18:58:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 2672. [2021-11-25 18:58:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2662 states have (on average 2.298271975957926) internal successors, (6118), 2671 states have internal predecessors, (6118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 6118 transitions. [2021-11-25 18:58:45,199 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 6118 transitions. Word has length 23 [2021-11-25 18:58:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:45,199 INFO L470 AbstractCegarLoop]: Abstraction has 2672 states and 6118 transitions. [2021-11-25 18:58:45,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 6118 transitions. [2021-11-25 18:58:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:58:45,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:45,201 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 18:58:45,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:58:45,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2021-11-25 18:58:45,404 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:58:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -959471414, now seen corresponding path program 1 times [2021-11-25 18:58:45,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:45,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041890321] [2021-11-25 18:58:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:45,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:45,840 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 18:58:45,840 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:45,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041890321] [2021-11-25 18:58:45,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041890321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:45,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:45,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:58:45,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182592737] [2021-11-25 18:58:45,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:45,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:58:45,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:45,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:58:45,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:58:45,841 INFO L87 Difference]: Start difference. First operand 2672 states and 6118 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 18:58:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:48,337 INFO L93 Difference]: Finished difference Result 3566 states and 8129 transitions. [2021-11-25 18:58:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 18:58:48,338 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 18:58:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:48,342 INFO L225 Difference]: With dead ends: 3566 [2021-11-25 18:58:48,342 INFO L226 Difference]: Without dead ends: 3480 [2021-11-25 18:58:48,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:58:48,342 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 403 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:48,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 35 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 18:58:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2021-11-25 18:58:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 2695. [2021-11-25 18:58:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2685 states have (on average 2.296461824953445) internal successors, (6166), 2694 states have internal predecessors, (6166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 6166 transitions. [2021-11-25 18:58:48,374 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 6166 transitions. Word has length 23 [2021-11-25 18:58:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:48,374 INFO L470 AbstractCegarLoop]: Abstraction has 2695 states and 6166 transitions. [2021-11-25 18:58:48,374 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 18:58:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 6166 transitions. [2021-11-25 18:58:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:58:48,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:48,376 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 18:58:48,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-11-25 18:58:48,376 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:58:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:48,377 INFO L85 PathProgramCache]: Analyzing trace with hash 168389584, now seen corresponding path program 2 times [2021-11-25 18:58:48,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:48,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815508872] [2021-11-25 18:58:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:48,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:48,585 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 18:58:48,585 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:48,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815508872] [2021-11-25 18:58:48,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815508872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:48,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:48,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-25 18:58:48,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127552039] [2021-11-25 18:58:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:48,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:58:48,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:58:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:58:48,586 INFO L87 Difference]: Start difference. First operand 2695 states and 6166 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 18:58:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:50,092 INFO L93 Difference]: Finished difference Result 3132 states and 7089 transitions. [2021-11-25 18:58:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:58:50,092 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 18:58:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:50,097 INFO L225 Difference]: With dead ends: 3132 [2021-11-25 18:58:50,097 INFO L226 Difference]: Without dead ends: 3132 [2021-11-25 18:58:50,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:58:50,097 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 259 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:50,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 52 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 18:58:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2021-11-25 18:58:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 2738. [2021-11-25 18:58:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 2728 states have (on average 2.2983870967741935) internal successors, (6270), 2737 states have internal predecessors, (6270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 6270 transitions. [2021-11-25 18:58:50,128 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 6270 transitions. Word has length 23 [2021-11-25 18:58:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:50,128 INFO L470 AbstractCegarLoop]: Abstraction has 2738 states and 6270 transitions. [2021-11-25 18:58:50,128 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 18:58:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 6270 transitions. [2021-11-25 18:58:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:58:50,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:50,129 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 18:58:50,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-11-25 18:58:50,130 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:58:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1578726048, now seen corresponding path program 2 times [2021-11-25 18:58:50,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:50,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185571468] [2021-11-25 18:58:50,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:50,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:50,525 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 18:58:50,526 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185571468] [2021-11-25 18:58:50,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185571468] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:58:50,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:58:50,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-25 18:58:50,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977872364] [2021-11-25 18:58:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:58:50,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:58:50,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:50,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:58:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:58:50,528 INFO L87 Difference]: Start difference. First operand 2738 states and 6270 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 18:58:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:58:52,356 INFO L93 Difference]: Finished difference Result 3026 states and 6818 transitions. [2021-11-25 18:58:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:58:52,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 18:58:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:58:52,360 INFO L225 Difference]: With dead ends: 3026 [2021-11-25 18:58:52,360 INFO L226 Difference]: Without dead ends: 3026 [2021-11-25 18:58:52,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-11-25 18:58:52,360 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 275 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:58:52,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 32 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 18:58:52,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2021-11-25 18:58:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2682. [2021-11-25 18:58:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 2672 states have (on average 2.282934131736527) internal successors, (6100), 2681 states have internal predecessors, (6100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:58:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 6100 transitions. [2021-11-25 18:58:52,390 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 6100 transitions. Word has length 23 [2021-11-25 18:58:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:58:52,390 INFO L470 AbstractCegarLoop]: Abstraction has 2682 states and 6100 transitions. [2021-11-25 18:58:52,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 18:58:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 6100 transitions. [2021-11-25 18:58:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:58:52,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:58:52,391 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 18:58:52,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-11-25 18:58:52,392 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:58:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:58:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1055818992, now seen corresponding path program 3 times [2021-11-25 18:58:52,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:58:52,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264408653] [2021-11-25 18:58:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:58:52,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:58:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:58:53,162 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 18:58:53,163 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:58:53,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264408653] [2021-11-25 18:58:53,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264408653] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:58:53,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893171214] [2021-11-25 18:58:53,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:58:53,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:58:53,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:58:53,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:58:53,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:58:53,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:58:53,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:58:53,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 18:58:53,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:58:53,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:53,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:53,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:53,729 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:58:53,730 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 18:58:53,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:53,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:53,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:53,750 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:58:53,750 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 18:58:53,761 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 44 treesize of output 42 [2021-11-25 18:58:53,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:53,775 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 18:58:53,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:53,784 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 18:58:54,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:54,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:58:54,175 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 18:58:54,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:54,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:58:54,182 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 18:58:54,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:54,459 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 18:58:54,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:58:54,463 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 18:58:54,538 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 18:58:54,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:58:54,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181| Int)) (or (and (forall ((v_ArrVal_9376 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181| v_ArrVal_9376) |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|)) (forall ((v_ArrVal_9375 (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_181| v_ArrVal_9375) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))))) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181|))) is different from false [2021-11-25 18:58:54,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181|) (and (forall ((v_ArrVal_9376 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181| v_ArrVal_9376) |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|)) (forall ((v_ArrVal_9375 (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_181| v_ArrVal_9375) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))))))) is different from false [2021-11-25 18:58:54,725 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:58:54,725 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 18:58:54,733 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:58:54,733 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 18:58:54,739 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 18:58:54,744 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 18:58:55,267 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 18:58:55,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893171214] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:58:55,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [819413482] [2021-11-25 18:58:55,268 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 18:58:55,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:58:55,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 40 [2021-11-25 18:58:55,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178421690] [2021-11-25 18:58:55,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:58:55,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-25 18:58:55,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:58:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-25 18:58:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1340, Unknown=2, NotChecked=150, Total=1640 [2021-11-25 18:58:55,270 INFO L87 Difference]: Start difference. First operand 2682 states and 6100 transitions. Second operand has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 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 18:58:59,147 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (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_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 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181|) (and (forall ((v_ArrVal_9376 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181| v_ArrVal_9376) |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|)) (forall ((v_ArrVal_9375 (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_181| v_ArrVal_9375) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))))))) (= |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|) (< |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_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) is different from false [2021-11-25 18:58:59,627 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_181| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181|) (and (forall ((v_ArrVal_9376 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181| v_ArrVal_9376) |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|)) (forall ((v_ArrVal_9375 (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_181| v_ArrVal_9375) |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.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 18:59:00,418 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_181| Int)) (or (and (forall ((v_ArrVal_9376 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181| v_ArrVal_9376) |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|)) (forall ((v_ArrVal_9375 (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_181| v_ArrVal_9375) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))))) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_181|))) (< (+ |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 18:59:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:02,597 INFO L93 Difference]: Finished difference Result 3524 states and 7890 transitions. [2021-11-25 18:59:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-25 18:59:02,598 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 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 18:59:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:02,601 INFO L225 Difference]: With dead ends: 3524 [2021-11-25 18:59:02,602 INFO L226 Difference]: Without dead ends: 3524 [2021-11-25 18:59:02,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=900, Invalid=4371, Unknown=5, NotChecked=730, Total=6006 [2021-11-25 18:59:02,602 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1201 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 6395 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 7790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 6395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1246 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:02,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1201 Valid, 87 Invalid, 7790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 6395 Invalid, 0 Unknown, 1246 Unchecked, 3.9s Time] [2021-11-25 18:59:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2021-11-25 18:59:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 2686. [2021-11-25 18:59:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2676 states have (on average 2.282511210762332) internal successors, (6108), 2685 states have internal predecessors, (6108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 6108 transitions. [2021-11-25 18:59:02,634 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 6108 transitions. Word has length 23 [2021-11-25 18:59:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:02,634 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 6108 transitions. [2021-11-25 18:59:02,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 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 18:59:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 6108 transitions. [2021-11-25 18:59:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:02,635 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:02,635 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 18:59:02,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:59:02,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:59:02,836 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash -754337220, now seen corresponding path program 4 times [2021-11-25 18:59:02,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:02,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007081015] [2021-11-25 18:59:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:02,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:04,036 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 18:59:04,036 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:04,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007081015] [2021-11-25 18:59:04,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007081015] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:59:04,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419746338] [2021-11-25 18:59:04,037 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:59:04,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:59:04,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:59:04,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:59:04,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:59:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:04,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-25 18:59:04,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:59:04,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,612 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 18:59:04,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,623 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 18:59:04,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,630 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 18:59:04,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,635 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 18:59:04,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,641 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 18:59:04,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:04,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:04,996 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 18:59:05,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:05,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:05,009 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 18:59:05,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:05,170 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 18:59:05,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:05,174 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 18:59:05,189 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 18:59:05,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:59:05,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419746338] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:05,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:59:05,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 28 [2021-11-25 18:59:05,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858835842] [2021-11-25 18:59:05,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:05,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:59:05,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:05,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:59:05,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:59:05,190 INFO L87 Difference]: Start difference. First operand 2686 states and 6108 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 18:59:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:06,748 INFO L93 Difference]: Finished difference Result 3151 states and 7033 transitions. [2021-11-25 18:59:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 18:59:06,748 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 18:59:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:06,751 INFO L225 Difference]: With dead ends: 3151 [2021-11-25 18:59:06,751 INFO L226 Difference]: Without dead ends: 3151 [2021-11-25 18:59:06,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:59:06,752 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 332 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:06,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 33 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 18:59:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2021-11-25 18:59:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2785. [2021-11-25 18:59:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2773 states have (on average 2.2661377569419403) internal successors, (6284), 2784 states have internal predecessors, (6284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 6284 transitions. [2021-11-25 18:59:06,791 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 6284 transitions. Word has length 23 [2021-11-25 18:59:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:06,791 INFO L470 AbstractCegarLoop]: Abstraction has 2785 states and 6284 transitions. [2021-11-25 18:59:06,791 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 18:59:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 6284 transitions. [2021-11-25 18:59:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:06,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:06,792 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 18:59:06,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 18:59:06,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2021-11-25 18:59:06,993 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 407532908, now seen corresponding path program 3 times [2021-11-25 18:59:06,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:06,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318980295] [2021-11-25 18:59:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:06,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:07,698 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 18:59:07,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:07,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318980295] [2021-11-25 18:59:07,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318980295] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:07,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:59:07,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 18:59:07,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019116844] [2021-11-25 18:59:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:07,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 18:59:07,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 18:59:07,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:59:07,700 INFO L87 Difference]: Start difference. First operand 2785 states and 6284 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 18:59:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:11,853 INFO L93 Difference]: Finished difference Result 3111 states and 6963 transitions. [2021-11-25 18:59:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-25 18:59:11,854 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 18:59:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:11,857 INFO L225 Difference]: With dead ends: 3111 [2021-11-25 18:59:11,857 INFO L226 Difference]: Without dead ends: 3107 [2021-11-25 18:59:11,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=217, Invalid=1115, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:59:11,858 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 420 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 4225 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:11,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 47 Invalid, 4272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4225 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-25 18:59:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2021-11-25 18:59:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2784. [2021-11-25 18:59:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2772 states have (on average 2.2662337662337664) internal successors, (6282), 2783 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 6282 transitions. [2021-11-25 18:59:11,889 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 6282 transitions. Word has length 23 [2021-11-25 18:59:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:11,889 INFO L470 AbstractCegarLoop]: Abstraction has 2784 states and 6282 transitions. [2021-11-25 18:59:11,889 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 18:59:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 6282 transitions. [2021-11-25 18:59:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:11,892 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:11,892 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 18:59:11,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-11-25 18:59:11,893 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1535393906, now seen corresponding path program 5 times [2021-11-25 18:59:11,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:11,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760114562] [2021-11-25 18:59:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:11,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:12,656 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 18:59:12,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:12,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760114562] [2021-11-25 18:59:12,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760114562] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:59:12,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687365244] [2021-11-25 18:59:12,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:59:12,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:59:12,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:59:12,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:59:12,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:59:13,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:59:13,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:59:13,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 91 conjunts are in the unsatisfiable core [2021-11-25 18:59:13,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:59:13,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,331 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:59:13,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 71 [2021-11-25 18:59:13,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,369 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:59:13,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 71 [2021-11-25 18:59:13,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,379 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 18:59:13,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,389 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 18:59:13,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,406 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 18:59:13,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,421 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 25 treesize of output 29 [2021-11-25 18:59:13,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,434 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 18:59:13,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 41 [2021-11-25 18:59:13,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-11-25 18:59:13,545 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 116 treesize of output 94 [2021-11-25 18:59:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 51 [2021-11-25 18:59:13,618 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 97 treesize of output 79 [2021-11-25 18:59:13,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 44 [2021-11-25 18:59:13,778 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 24 treesize of output 18 [2021-11-25 18:59:13,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:13,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-11-25 18:59:14,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:14,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:14,265 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 18:59:14,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:14,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:14,276 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 18:59:14,453 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 18:59:14,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:59:14,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687365244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:14,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:59:14,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 27 [2021-11-25 18:59:14,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76063019] [2021-11-25 18:59:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:14,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:59:14,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:14,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:59:14,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2021-11-25 18:59:14,455 INFO L87 Difference]: Start difference. First operand 2784 states and 6282 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 18:59:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:16,360 INFO L93 Difference]: Finished difference Result 3140 states and 7005 transitions. [2021-11-25 18:59:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:59:16,361 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 18:59:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:16,364 INFO L225 Difference]: With dead ends: 3140 [2021-11-25 18:59:16,364 INFO L226 Difference]: Without dead ends: 3140 [2021-11-25 18:59:16,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 18:59:16,365 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 321 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:16,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 48 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-25 18:59:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2021-11-25 18:59:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 2794. [2021-11-25 18:59:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2782 states have (on average 2.2667145938173974) internal successors, (6306), 2793 states have internal predecessors, (6306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 6306 transitions. [2021-11-25 18:59:16,395 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 6306 transitions. Word has length 23 [2021-11-25 18:59:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:16,396 INFO L470 AbstractCegarLoop]: Abstraction has 2794 states and 6306 transitions. [2021-11-25 18:59:16,396 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 18:59:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 6306 transitions. [2021-11-25 18:59:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:16,397 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:16,397 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 18:59:16,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:59:16,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:59:16,598 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:16,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1071345228, now seen corresponding path program 6 times [2021-11-25 18:59:16,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:16,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789081920] [2021-11-25 18:59:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:16,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:16,936 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 18:59:16,936 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:16,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789081920] [2021-11-25 18:59:16,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789081920] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:59:16,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682627565] [2021-11-25 18:59:16,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:59:16,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:59:16,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:59:16,938 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:59:16,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:59:17,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:59:17,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:59:17,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 128 conjunts are in the unsatisfiable core [2021-11-25 18:59:17,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:59:17,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,673 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 18:59:17,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,682 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 37 treesize of output 41 [2021-11-25 18:59:17,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,688 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 38 treesize of output 41 [2021-11-25 18:59:17,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,694 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 18:59:17,717 INFO L354 Elim1Store]: treesize reduction 176, result has 14.1 percent of original size [2021-11-25 18:59:17,717 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 2 case distinctions, treesize of input 36 treesize of output 44 [2021-11-25 18:59:17,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,738 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 63 treesize of output 64 [2021-11-25 18:59:17,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,746 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 18:59:17,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:17,754 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 18:59:18,265 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 65 treesize of output 49 [2021-11-25 18:59:18,476 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:59:18,476 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 18:59:18,481 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-25 18:59:18,482 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 18:59:18,551 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:59:18,551 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 37 treesize of output 34 [2021-11-25 18:59:18,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:18,692 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 35 treesize of output 31 [2021-11-25 18:59:18,750 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:59:18,750 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 18:59:18,774 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 18:59:18,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:59:18,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 18:59:18,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) is different from false [2021-11-25 18:59:18,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int)) (v_ArrVal_10057 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_10057) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 18:59:18,922 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int)) (v_ArrVal_10057 (Array Int Int)) (v_ArrVal_10056 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_10056) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_10057) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) is different from false [2021-11-25 18:59:18,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int)) (v_ArrVal_10057 (Array Int Int)) (v_ArrVal_10056 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_10056) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_10057) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) is different from false [2021-11-25 18:59:18,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int)) (v_ArrVal_10057 (Array Int Int)) (v_ArrVal_10056 (Array Int Int))) (or (not (= 0 (select (select (store (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_10056) .cse0 v_ArrVal_10057))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) is different from false [2021-11-25 18:59:19,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int)) (v_ArrVal_10057 (Array Int Int)) (v_ArrVal_10056 (Array Int Int))) (or (not (= (select (select (store (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_10056) .cse0 v_ArrVal_10057))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) is different from false [2021-11-25 18:59:19,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int)) (v_ArrVal_10057 (Array Int Int)) (v_ArrVal_10056 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|) (not (= (select (select (store (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_10056) .cse0 v_ArrVal_10057))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 18:59:19,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int)) (v_ArrVal_10057 (Array Int Int)) (v_ArrVal_10056 (Array Int Int))) (or (not (= (select (select (store (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_10056) .cse0 v_ArrVal_10057))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) is different from false [2021-11-25 18:59:19,071 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int)) (v_ArrVal_10057 (Array Int Int)) (v_ArrVal_10056 (Array Int Int))) (or (not (= (select (select (store (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_10056) .cse0 v_ArrVal_10057))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) is different from false [2021-11-25 18:59:19,073 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 18:59:19,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682627565] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:59:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1322163488] [2021-11-25 18:59:19,074 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 18:59:19,075 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:59:19,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 36 [2021-11-25 18:59:19,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331705133] [2021-11-25 18:59:19,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:59:19,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 18:59:19,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 18:59:19,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=631, Unknown=10, NotChecked=590, Total=1332 [2021-11-25 18:59:19,077 INFO L87 Difference]: Start difference. First operand 2794 states and 6306 transitions. Second operand has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:22,314 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 4)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|)))))) is different from false [2021-11-25 18:59:22,774 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= |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|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~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.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= .cse0 (select .cse1 4)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|)))) is different from false [2021-11-25 18:59:23,037 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse2 0)) (.cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= .cse0 (select .cse2 4)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)))) is different from false [2021-11-25 18:59:23,642 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 0))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (< (+ .cse0 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 4)) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0)))) is different from false [2021-11-25 18:59:23,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse2 0)) (.cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| Int) (v_ArrVal_10058 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_183| v_ArrVal_10058) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (< (+ .cse0 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse2 4)) (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|)) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)))) is different from false [2021-11-25 18:59:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:26,022 INFO L93 Difference]: Finished difference Result 4403 states and 9835 transitions. [2021-11-25 18:59:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-25 18:59:26,022 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 18:59:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:26,027 INFO L225 Difference]: With dead ends: 4403 [2021-11-25 18:59:26,027 INFO L226 Difference]: Without dead ends: 4403 [2021-11-25 18:59:26,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 15 IntricatePredicates, 5 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=571, Invalid=3134, Unknown=15, NotChecked=1980, Total=5700 [2021-11-25 18:59:26,027 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 833 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 5052 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 10173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 5052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5088 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:26,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [833 Valid, 84 Invalid, 10173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 5052 Invalid, 0 Unknown, 5088 Unchecked, 3.5s Time] [2021-11-25 18:59:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2021-11-25 18:59:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 2947. [2021-11-25 18:59:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2935 states have (on average 2.2739352640545145) internal successors, (6674), 2946 states have internal predecessors, (6674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 6674 transitions. [2021-11-25 18:59:26,064 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 6674 transitions. Word has length 23 [2021-11-25 18:59:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:26,064 INFO L470 AbstractCegarLoop]: Abstraction has 2947 states and 6674 transitions. [2021-11-25 18:59:26,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 6674 transitions. [2021-11-25 18:59:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:26,066 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:26,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, 1, 1, 1] [2021-11-25 18:59:26,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:59:26,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:59:26,266 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:26,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash -211721726, now seen corresponding path program 4 times [2021-11-25 18:59:26,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:26,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274539240] [2021-11-25 18:59:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:26,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:26,930 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 18:59:26,930 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274539240] [2021-11-25 18:59:26,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274539240] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:26,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:59:26,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 18:59:26,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434952198] [2021-11-25 18:59:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:26,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:59:26,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:59:26,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:59:26,931 INFO L87 Difference]: Start difference. First operand 2947 states and 6674 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 18:59:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:29,573 INFO L93 Difference]: Finished difference Result 3651 states and 8192 transitions. [2021-11-25 18:59:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 18:59:29,573 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 18:59:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:29,578 INFO L225 Difference]: With dead ends: 3651 [2021-11-25 18:59:29,578 INFO L226 Difference]: Without dead ends: 3649 [2021-11-25 18:59:29,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:59:29,578 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 384 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 2792 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:29,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 37 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2792 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 18:59:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2021-11-25 18:59:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 2932. [2021-11-25 18:59:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2921 states have (on average 2.278671687778158) internal successors, (6656), 2931 states have internal predecessors, (6656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 6656 transitions. [2021-11-25 18:59:29,612 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 6656 transitions. Word has length 23 [2021-11-25 18:59:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:29,612 INFO L470 AbstractCegarLoop]: Abstraction has 2932 states and 6656 transitions. [2021-11-25 18:59:29,612 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 18:59:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 6656 transitions. [2021-11-25 18:59:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:29,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:29,613 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 18:59:29,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-11-25 18:59:29,613 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1902093982, now seen corresponding path program 5 times [2021-11-25 18:59:29,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:29,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094523799] [2021-11-25 18:59:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:29,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:31,315 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 18:59:31,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:31,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094523799] [2021-11-25 18:59:31,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094523799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:31,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:59:31,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-25 18:59:31,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994296418] [2021-11-25 18:59:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:31,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-25 18:59:31,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-25 18:59:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:59:31,317 INFO L87 Difference]: Start difference. First operand 2932 states and 6656 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 18:59:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:38,087 INFO L93 Difference]: Finished difference Result 4161 states and 9340 transitions. [2021-11-25 18:59:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 18:59:38,088 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 18:59:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:38,092 INFO L225 Difference]: With dead ends: 4161 [2021-11-25 18:59:38,092 INFO L226 Difference]: Without dead ends: 4076 [2021-11-25 18:59:38,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=304, Invalid=1256, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:59:38,093 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 515 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 5029 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 5029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:38,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 51 Invalid, 5083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 5029 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-11-25 18:59:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2021-11-25 18:59:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3080. [2021-11-25 18:59:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3080 states, 3069 states have (on average 2.2883675464320627) internal successors, (7023), 3079 states have internal predecessors, (7023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 7023 transitions. [2021-11-25 18:59:38,132 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 7023 transitions. Word has length 23 [2021-11-25 18:59:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:38,132 INFO L470 AbstractCegarLoop]: Abstraction has 3080 states and 7023 transitions. [2021-11-25 18:59:38,132 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 18:59:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 7023 transitions. [2021-11-25 18:59:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:38,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:38,133 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 18:59:38,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-11-25 18:59:38,134 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash -594162510, now seen corresponding path program 6 times [2021-11-25 18:59:38,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:38,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788863128] [2021-11-25 18:59:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:38,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:38,817 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 18:59:38,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:38,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788863128] [2021-11-25 18:59:38,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788863128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:38,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:59:38,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 18:59:38,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821061483] [2021-11-25 18:59:38,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:38,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:59:38,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:38,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:59:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:59:38,819 INFO L87 Difference]: Start difference. First operand 3080 states and 7023 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 18:59:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:41,846 INFO L93 Difference]: Finished difference Result 3873 states and 8718 transitions. [2021-11-25 18:59:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 18:59:41,846 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 18:59:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:41,850 INFO L225 Difference]: With dead ends: 3873 [2021-11-25 18:59:41,850 INFO L226 Difference]: Without dead ends: 3769 [2021-11-25 18:59:41,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:59:41,851 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 496 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 3775 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:41,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 45 Invalid, 3806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3775 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-25 18:59:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2021-11-25 18:59:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 3114. [2021-11-25 18:59:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 3103 states have (on average 2.290686432484692) internal successors, (7108), 3113 states have internal predecessors, (7108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 7108 transitions. [2021-11-25 18:59:41,887 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 7108 transitions. Word has length 23 [2021-11-25 18:59:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:41,888 INFO L470 AbstractCegarLoop]: Abstraction has 3114 states and 7108 transitions. [2021-11-25 18:59:41,888 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 18:59:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 7108 transitions. [2021-11-25 18:59:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:41,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:41,889 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 18:59:41,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-11-25 18:59:41,889 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:41,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1265012316, now seen corresponding path program 7 times [2021-11-25 18:59:41,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:41,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130671361] [2021-11-25 18:59:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:41,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:42,737 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 18:59:42,737 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:42,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130671361] [2021-11-25 18:59:42,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130671361] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:59:42,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875327432] [2021-11-25 18:59:42,738 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:59:42,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:59:42,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:59:42,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:59:42,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 18:59:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:43,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 148 conjunts are in the unsatisfiable core [2021-11-25 18:59:43,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:59:43,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,354 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 18:59:43,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,362 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 18:59:43,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,369 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 18:59:43,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,374 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 18:59:43,378 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 18:59:43,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:43,382 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 18:59:44,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:44,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:44,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:44,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:44,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2021-11-25 18:59:44,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:44,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:44,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:44,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:44,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:44,209 INFO L354 Elim1Store]: treesize reduction 56, result has 49.1 percent of original size [2021-11-25 18:59:44,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 66 treesize of output 80 [2021-11-25 18:59:44,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:44,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:44,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2021-11-25 18:59:44,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:59:44,571 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 33 treesize of output 23 [2021-11-25 18:59:44,581 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 18:59:44,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:59:44,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875327432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:44,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:59:44,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 29 [2021-11-25 18:59:44,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713502666] [2021-11-25 18:59:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:44,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:59:44,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:59:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:59:44,583 INFO L87 Difference]: Start difference. First operand 3114 states and 7108 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 18:59:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:47,341 INFO L93 Difference]: Finished difference Result 3555 states and 8036 transitions. [2021-11-25 18:59:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 18:59:47,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 18:59:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:47,345 INFO L225 Difference]: With dead ends: 3555 [2021-11-25 18:59:47,345 INFO L226 Difference]: Without dead ends: 3555 [2021-11-25 18:59:47,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=1267, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:59:47,346 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 443 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:47,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 26 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-25 18:59:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2021-11-25 18:59:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3131. [2021-11-25 18:59:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 3120 states have (on average 2.291025641025641) internal successors, (7148), 3130 states have internal predecessors, (7148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 7148 transitions. [2021-11-25 18:59:47,381 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 7148 transitions. Word has length 23 [2021-11-25 18:59:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:47,381 INFO L470 AbstractCegarLoop]: Abstraction has 3131 states and 7148 transitions. [2021-11-25 18:59:47,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 18:59:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 7148 transitions. [2021-11-25 18:59:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:47,383 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:47,383 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 18:59:47,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 18:59:47,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2021-11-25 18:59:47,588 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:47,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1986808098, now seen corresponding path program 7 times [2021-11-25 18:59:47,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:47,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420879928] [2021-11-25 18:59:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:47,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:48,578 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 18:59:48,578 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:48,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420879928] [2021-11-25 18:59:48,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420879928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:48,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:59:48,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-25 18:59:48,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447380032] [2021-11-25 18:59:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:48,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 18:59:48,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:48,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 18:59:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:59:48,579 INFO L87 Difference]: Start difference. First operand 3131 states and 7148 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 18:59:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:53,596 INFO L93 Difference]: Finished difference Result 5025 states and 11321 transitions. [2021-11-25 18:59:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-25 18:59:53,596 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 18:59:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:53,602 INFO L225 Difference]: With dead ends: 5025 [2021-11-25 18:59:53,602 INFO L226 Difference]: Without dead ends: 4939 [2021-11-25 18:59:53,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:59:53,602 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 750 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 3444 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:53,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [750 Valid, 25 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3444 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-25 18:59:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2021-11-25 18:59:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 3216. [2021-11-25 18:59:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3205 states have (on average 2.297347893915757) internal successors, (7363), 3215 states have internal predecessors, (7363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 7363 transitions. [2021-11-25 18:59:53,643 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 7363 transitions. Word has length 23 [2021-11-25 18:59:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:53,644 INFO L470 AbstractCegarLoop]: Abstraction has 3216 states and 7363 transitions. [2021-11-25 18:59:53,644 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 18:59:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 7363 transitions. [2021-11-25 18:59:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:53,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:53,645 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 18:59:53,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-11-25 18:59:53,646 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:53,646 INFO L85 PathProgramCache]: Analyzing trace with hash -509448394, now seen corresponding path program 8 times [2021-11-25 18:59:53,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:53,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685653862] [2021-11-25 18:59:53,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:53,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:53,918 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 18:59:53,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:53,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685653862] [2021-11-25 18:59:53,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685653862] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:59:53,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:59:53,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:59:53,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026257656] [2021-11-25 18:59:53,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:59:53,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:59:53,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:53,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:59:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:59:53,919 INFO L87 Difference]: Start difference. First operand 3216 states and 7363 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 18:59:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:59:56,723 INFO L93 Difference]: Finished difference Result 4958 states and 11185 transitions. [2021-11-25 18:59:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-25 18:59:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 18:59:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:59:56,729 INFO L225 Difference]: With dead ends: 4958 [2021-11-25 18:59:56,729 INFO L226 Difference]: Without dead ends: 4851 [2021-11-25 18:59:56,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 18:59:56,730 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 560 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 4268 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:59:56,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 99 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4268 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 18:59:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2021-11-25 18:59:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 3167. [2021-11-25 18:59:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3156 states have (on average 2.2924588086185045) internal successors, (7235), 3166 states have internal predecessors, (7235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:59:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 7235 transitions. [2021-11-25 18:59:56,770 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 7235 transitions. Word has length 23 [2021-11-25 18:59:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:59:56,770 INFO L470 AbstractCegarLoop]: Abstraction has 3167 states and 7235 transitions. [2021-11-25 18:59:56,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 18:59:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 7235 transitions. [2021-11-25 18:59:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:59:56,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:59:56,772 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 18:59:56,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-11-25 18:59:56,772 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 18:59:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:59:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1180298200, now seen corresponding path program 8 times [2021-11-25 18:59:56,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:59:56,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795168756] [2021-11-25 18:59:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:59:56,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:59:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:59:57,613 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 18:59:57,613 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:59:57,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795168756] [2021-11-25 18:59:57,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795168756] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:59:57,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327568132] [2021-11-25 18:59:57,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:59:57,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:59:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:59:57,617 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:59:57,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 18:59:58,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:59:58,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:59:58,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 125 conjunts are in the unsatisfiable core [2021-11-25 18:59:58,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:59:58,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,287 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 18:59:58,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,297 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 18:59:58,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,304 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 18:59:58,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,311 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 18:59:58,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,323 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 18:59:58,347 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 18:59:58,347 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 88 treesize of output 82 [2021-11-25 18:59:58,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:58,355 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 18:59:58,363 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 18:59:58,951 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 15 treesize of output 7 [2021-11-25 18:59:59,111 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 18:59:59,111 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 85 treesize of output 66 [2021-11-25 18:59:59,115 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 18:59:59,205 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:59:59,206 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 37 treesize of output 34 [2021-11-25 18:59:59,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:59:59,369 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 35 treesize of output 31 [2021-11-25 18:59:59,415 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:59:59,415 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 18:59:59,417 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 18:59:59,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:59:59,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 18:59:59,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|))) is different from false [2021-11-25 18:59:59,507 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int)) (v_ArrVal_10881 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_10881) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|))) is different from false [2021-11-25 18:59:59,540 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int)) (v_ArrVal_10881 (Array Int Int)) (v_ArrVal_10880 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_10880) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_10881) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|))) is different from false [2021-11-25 18:59:59,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int)) (v_ArrVal_10881 (Array Int Int)) (v_ArrVal_10880 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_10880) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_10881) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 18:59:59,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int)) (v_ArrVal_10881 (Array Int Int)) (v_ArrVal_10880 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|) (not (= (select (select (store (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_10880) .cse0 v_ArrVal_10881))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 18:59:59,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int)) (v_ArrVal_10881 (Array Int Int)) (v_ArrVal_10880 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|) (not (= (select (select (store (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_10880) .cse0 v_ArrVal_10881))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 18:59:59,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int)) (v_ArrVal_10881 (Array Int Int)) (v_ArrVal_10880 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|) (not (= (select (select (store (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_10880) .cse0 v_ArrVal_10881))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 18:59:59,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int)) (v_ArrVal_10881 (Array Int Int)) (v_ArrVal_10880 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|) (not (= (select (select (store (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_10880) .cse0 v_ArrVal_10881))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 18:59:59,649 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int)) (v_ArrVal_10881 (Array Int Int)) (v_ArrVal_10880 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|) (not (= (select (select (store (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_10880) .cse0 v_ArrVal_10881))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 18:59:59,650 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 18:59:59,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327568132] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:59:59,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1497122555] [2021-11-25 18:59:59,651 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 18:59:59,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:59:59,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 12] total 41 [2021-11-25 18:59:59,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814363238] [2021-11-25 18:59:59,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:59:59,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-25 18:59:59,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:59:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-25 18:59:59,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=918, Unknown=10, NotChecked=710, Total=1806 [2021-11-25 18:59:59,654 INFO L87 Difference]: Start difference. First operand 3167 states and 7235 transitions. Second operand has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:02,264 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse0) (< .cse0 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (= (select .cse1 0) .cse0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse0 0)) (or (and (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) 0) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))))) is different from false [2021-11-25 19:00:02,501 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 0)) (.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse2 (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)) (.cse3 (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) (.cse4 (select .cse5 4))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (or (and .cse0 .cse1 (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| 0) .cse2) .cse3) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|))) (or (and (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) 0) .cse0 .cse1 .cse2) .cse3) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse4) (< .cse4 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_fifo_empty_~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|) (= (select .cse5 0) .cse4) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse4 0))))) is different from false [2021-11-25 19:00:02,635 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|))) (< .cse0 |c_#StackHeapBarrier|) (= (select .cse1 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse0 0))))) is different from false [2021-11-25 19:00:03,998 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse0 4))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= (select .cse0 0) .cse1) (= |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< (+ .cse1 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse1 0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| Int) (v_ArrVal_10882 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_185| v_ArrVal_10882) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))))) is different from false [2021-11-25 19:00:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:00:07,781 INFO L93 Difference]: Finished difference Result 5966 states and 13670 transitions. [2021-11-25 19:00:07,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-25 19:00:07,781 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:00:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:00:07,788 INFO L225 Difference]: With dead ends: 5966 [2021-11-25 19:00:07,788 INFO L226 Difference]: Without dead ends: 5966 [2021-11-25 19:00:07,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=765, Invalid=3309, Unknown=14, NotChecked=1918, Total=6006 [2021-11-25 19:00:07,789 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 2181 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 7057 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 7057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4947 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:00:07,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2181 Valid, 68 Invalid, 12172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 7057 Invalid, 0 Unknown, 4947 Unchecked, 4.9s Time] [2021-11-25 19:00:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2021-11-25 19:00:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3490. [2021-11-25 19:00:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3479 states have (on average 2.3173325668295486) internal successors, (8062), 3489 states have internal predecessors, (8062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 8062 transitions. [2021-11-25 19:00:07,862 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 8062 transitions. Word has length 23 [2021-11-25 19:00:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:00:07,862 INFO L470 AbstractCegarLoop]: Abstraction has 3490 states and 8062 transitions. [2021-11-25 19:00:07,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 8062 transitions. [2021-11-25 19:00:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:00:07,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:00:07,864 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 19:00:07,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 19:00:08,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:08,065 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:00:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:00:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash 514157242, now seen corresponding path program 9 times [2021-11-25 19:00:08,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:00:08,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788234154] [2021-11-25 19:00:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:00:08,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:00:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:00:08,716 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 19:00:08,716 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:00:08,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788234154] [2021-11-25 19:00:08,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788234154] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:00:08,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037887457] [2021-11-25 19:00:08,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:00:08,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:08,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:00:08,727 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:00:08,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 19:00:09,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:00:09,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:00:09,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 19:00:09,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:00:09,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,358 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 19:00:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,370 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 19:00:09,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:09,378 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 19:00:09,399 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 19:00:09,400 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 113 treesize of output 95 [2021-11-25 19:00:09,405 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 19:00:10,057 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 65 treesize of output 49 [2021-11-25 19:00:10,234 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:00:10,234 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 19:00:10,239 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-25 19:00:10,240 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 19:00:10,330 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:00:10,331 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 37 treesize of output 34 [2021-11-25 19:00:10,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:10,485 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 35 treesize of output 31 [2021-11-25 19:00:10,561 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:00:10,561 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 19:00:10,563 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 19:00:10,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:00:10,576 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11085 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11085) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11085 (Array Int Int)) (v_ArrVal_11084 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= 0 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_11084) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11085) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2021-11-25 19:00:10,672 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11085 (Array Int Int)) (v_ArrVal_11084 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_11084) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_11085) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,685 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11085 (Array Int Int)) (v_ArrVal_11084 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (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_11084) .cse0 v_ArrVal_11085))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11085 (Array Int Int)) (v_ArrVal_11084 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (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_11084) .cse0 v_ArrVal_11085))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11085 (Array Int Int)) (v_ArrVal_11084 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (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_11084) .cse0 v_ArrVal_11085))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11085 (Array Int Int)) (v_ArrVal_11084 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (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_11084) .cse0 v_ArrVal_11085))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11085 (Array Int Int)) (v_ArrVal_11084 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (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_11084) .cse0 v_ArrVal_11085))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:00:10,794 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 19:00:10,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037887457] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:00:10,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1274845633] [2021-11-25 19:00:10,795 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 19:00:10,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:00:10,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 38 [2021-11-25 19:00:10,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686761980] [2021-11-25 19:00:10,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:00:10,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-25 19:00:10,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:00:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-25 19:00:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=750, Unknown=10, NotChecked=650, Total=1560 [2021-11-25 19:00:10,796 INFO L87 Difference]: Start difference. First operand 3490 states and 8062 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:12,976 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse2 4)) (.cse0 (select .cse2 0))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse1) (or (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= .cse0 .cse1) (< .cse0 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((v_ArrVal_11085 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11085) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))) is different from false [2021-11-25 19:00:13,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse5 4)) (.cse0 (select .cse5 0))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse1) (= .cse0 .cse1) (< .cse0 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((v_ArrVal_11085 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11085) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (let ((.cse3 (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse4 (not (= (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (or (and (or (= (select .cse2 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base|) (not (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)))) .cse3 .cse4 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (and (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) .cse3 .cse4))))))) is different from false [2021-11-25 19:00:13,287 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse2 4)) (.cse0 (select .cse2 0))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse1) (= .cse0 .cse1) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< .cse0 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0)))) is different from false [2021-11-25 19:00:13,625 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse2 0))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (or (and (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (not (= (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) (and (not (= (select .cse0 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) 0)) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (= .cse1 (select .cse2 4)) (< .cse1 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0)))) is different from false [2021-11-25 19:00:13,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (= .cse0 (select .cse1 4)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0)))) is different from false [2021-11-25 19:00:15,145 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 0))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (< (+ .cse0 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 4)) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| Int) (v_ArrVal_11086 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_187| v_ArrVal_11086) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))))) is different from false [2021-11-25 19:00:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:00:17,499 INFO L93 Difference]: Finished difference Result 5473 states and 12604 transitions. [2021-11-25 19:00:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-25 19:00:17,500 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:00:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:00:17,506 INFO L225 Difference]: With dead ends: 5473 [2021-11-25 19:00:17,506 INFO L226 Difference]: Without dead ends: 5473 [2021-11-25 19:00:17,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 16 IntricatePredicates, 2 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=738, Invalid=2850, Unknown=16, NotChecked=2096, Total=5700 [2021-11-25 19:00:17,506 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 1648 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 4984 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 12723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 4984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7631 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:00:17,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1648 Valid, 50 Invalid, 12723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 4984 Invalid, 0 Unknown, 7631 Unchecked, 3.6s Time] [2021-11-25 19:00:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2021-11-25 19:00:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 3734. [2021-11-25 19:00:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3723 states have (on average 2.3341391351060974) internal successors, (8690), 3733 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 8690 transitions. [2021-11-25 19:00:17,555 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 8690 transitions. Word has length 23 [2021-11-25 19:00:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:00:17,556 INFO L470 AbstractCegarLoop]: Abstraction has 3734 states and 8690 transitions. [2021-11-25 19:00:17,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 8690 transitions. [2021-11-25 19:00:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:00:17,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:00:17,558 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 19:00:17,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 19:00:17,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:17,759 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:00:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:00:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 917261608, now seen corresponding path program 10 times [2021-11-25 19:00:17,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:00:17,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095056333] [2021-11-25 19:00:17,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:00:17,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:00:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:00:18,462 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 19:00:18,462 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:00:18,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095056333] [2021-11-25 19:00:18,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095056333] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:00:18,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819984864] [2021-11-25 19:00:18,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:00:18,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:18,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:00:18,464 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:00:18,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 19:00:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:00:19,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 140 conjunts are in the unsatisfiable core [2021-11-25 19:00:19,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:00:19,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:19,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:19,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:19,080 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 40 treesize of output 44 [2021-11-25 19:00:19,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:19,084 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 34 treesize of output 30 [2021-11-25 19:00:19,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:19,088 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 19:00:19,091 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 19:00:19,554 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 19:00:19,749 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-11-25 19:00:19,750 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 50 treesize of output 58 [2021-11-25 19:00:19,764 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 21 treesize of output 13 [2021-11-25 19:00:19,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:19,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:19,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:00:19,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2021-11-25 19:00:20,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:20,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:20,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:00:20,061 INFO L354 Elim1Store]: treesize reduction 92, result has 15.6 percent of original size [2021-11-25 19:00:20,061 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 6 case distinctions, treesize of input 76 treesize of output 52 [2021-11-25 19:00:20,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:00:20,281 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 81 treesize of output 69 [2021-11-25 19:00:20,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:20,630 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-25 19:00:20,630 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2021-11-25 19:00:20,643 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 13 treesize of output 9 [2021-11-25 19:00:20,695 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:00:20,695 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 19:00:20,698 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 19:00:20,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:00:20,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:20,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:20,973 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:00:20,974 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 39 treesize of output 42 [2021-11-25 19:00:21,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_236 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_11287))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_236)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse1 (select (select .cse0 .cse1) (+ v_arrayElimCell_236 12))))) (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) is different from false [2021-11-25 19:00:21,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_236 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_11287))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (and (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_236)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse1 (select (select .cse0 .cse1) (+ v_arrayElimCell_236 12)))))))) is different from false [2021-11-25 19:00:21,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_236 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (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)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse2) (+ 12 .cse0)) v_ArrVal_11287))) (or (and (not (= v_arrayElimCell_236 .cse0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= .cse2 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (not (let ((.cse4 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse4 (select (select .cse1 .cse4) (+ v_arrayElimCell_236 12))))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|)))))) is different from false [2021-11-25 19:00:22,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_236 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse1) (+ 12 .cse0)) v_ArrVal_11287))) (or (and (not (= v_arrayElimCell_236 .cse0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (= .cse1 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (not (let ((.cse4 (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse4 (select (select .cse2 .cse4) (+ v_arrayElimCell_236 12))))) (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|)))))) is different from false [2021-11-25 19:00:22,782 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 161 treesize of output 125 [2021-11-25 19:00:22,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_238 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse4 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_238 12))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse2) v_ArrVal_11287))) (let ((.cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (not (= .cse0 .cse3)) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|))))))) is different from false [2021-11-25 19:00:22,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_238 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse4 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4)) (.cse3 (+ v_arrayElimCell_238 12))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse3) v_ArrVal_11287))) (let ((.cse1 (select (select .cse2 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4))) (or (not (= .cse0 .cse1)) (not (= (select (select .cse2 .cse1) .cse3) .cse1)) (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|))))))) is different from false [2021-11-25 19:00:22,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_238 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_238 12))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse2) v_ArrVal_11287))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (= .cse1 .cse3)))))))) is different from false [2021-11-25 19:00:22,900 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 19:00:22,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819984864] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:00:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884640478] [2021-11-25 19:00:22,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 19:00:22,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:00:22,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 48 [2021-11-25 19:00:22,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337787389] [2021-11-25 19:00:22,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:00:22,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-25 19:00:22,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:00:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-25 19:00:22,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1437, Unknown=9, NotChecked=774, Total=2450 [2021-11-25 19:00:22,918 INFO L87 Difference]: Start difference. First operand 3734 states and 8690 transitions. Second operand has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:23,138 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_238 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_238 12))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse2) v_ArrVal_11287))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (= .cse1 .cse3)))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse5 0)) (< .cse5 |c_#StackHeapBarrier|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse5) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) 4) 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select .cse6 4)))))) is different from false [2021-11-25 19:00:23,142 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_238 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse5 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse5)) (.cse4 (+ v_arrayElimCell_238 12))) (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse1) .cse4) v_ArrVal_11287))) (let ((.cse2 (select (select .cse3 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse5))) (or (not (= .cse1 .cse2)) (not (= (select (select .cse3 .cse2) .cse4) .cse2)) (not (= (select (select (store .cse3 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (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|) (not (= .cse6 0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (< .cse6 |c_#StackHeapBarrier|) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse6) (not (= (select .cse0 4) |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0)))) is different from false [2021-11-25 19:00:23,145 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= |c_pusherThread1of1ForFork0_~q~0#1.base| (select .cse0 4))) (= |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)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_238 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse6 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6)) (.cse4 (+ v_arrayElimCell_238 12))) (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse5) .cse4) v_ArrVal_11287))) (let ((.cse2 (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6))) (or (not (= .cse2 (select (select .cse3 .cse2) .cse4))) (not (= .cse2 .cse5)) (not (= (select (select (store .cse3 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|))))))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse1) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 19:00:23,149 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse10 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse0 .cse10)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10))) (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)) (= .cse1 |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (= .cse2 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< .cse3 |c_#StackHeapBarrier|) (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_236 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (let ((.cse6 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse5) (+ 12 .cse4)) v_ArrVal_11287))) (or (and (not (= v_arrayElimCell_236 .cse4)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (= .cse5 (select (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (not (let ((.cse8 (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse8 (select (select .cse6 .cse8) (+ v_arrayElimCell_236 12))))) (not (= (select (select (store .cse6 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|)))))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse3) (not (= .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| .cse2)))) is different from false [2021-11-25 19:00:23,172 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse10 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse0 (select .cse4 .cse10)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (= .cse1 (select .cse2 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= .cse3 0) (not (= (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_236 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (let ((.cse6 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse7) (+ 12 .cse5)) v_ArrVal_11287))) (or (and (not (= v_arrayElimCell_236 .cse5)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (= (select (select (store .cse6 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= .cse7 (select (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (not (let ((.cse9 (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse9 (select (select .cse6 .cse9) (+ v_arrayElimCell_236 12))))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|)))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse1 0)) (< .cse1 |c_#StackHeapBarrier|) (not (= .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| .cse3)))) is different from false [2021-11-25 19:00:23,194 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) 0) (not (= (select .cse3 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_236 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (let ((.cse5 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse6) (+ 12 .cse4)) v_ArrVal_11287))) (or (and (not (= v_arrayElimCell_236 .cse4)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (= (select (select (store .cse5 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= .cse6 (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (not (let ((.cse8 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse8 (select (select .cse5 .cse8) (+ v_arrayElimCell_236 12))))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|)))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse0 0)) (< .cse0 |c_#StackHeapBarrier|) (not (= (select .cse3 .cse2) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 19:00:23,232 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse2 (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (forall ((v_ArrVal_11290 (Array Int Int)) (v_arrayElimCell_236 Int) (v_ArrVal_11287 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_11287))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (and (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_236)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse1 (select (select .cse0 .cse1) (+ v_arrayElimCell_236 12)))))))) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (= .cse2 (select .cse3 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse2 0)) (= (select .cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (< .cse2 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 0) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 19:00:24,699 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (let ((.cse0 (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12))) (and (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) .cse0)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse3 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (or (and (< .cse1 |c_#StackHeapBarrier|) (not (= .cse1 0)) (= |c_ULTIMATE.start_fifo_front_~self#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) .cse0))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (and (not (= .cse2 0)) (< .cse2 |c_#StackHeapBarrier|) (= .cse2 .cse1))))))))) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_fifo_front_~self#1.offset|) (forall ((v_ArrVal_11290 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse4 (select .cse6 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (and (= (select (select |c_#memory_$Pointer$.base| .cse4) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)) .cse4) (not (= .cse5 0)) (< .cse5 |c_#StackHeapBarrier|) (= .cse5 .cse4)))))) is different from false [2021-11-25 19:00:25,130 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (= (select (select |c_#memory_$Pointer$.base| .cse0) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)) .cse0))) (not (= .cse1 0)) (< (+ .cse1 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_11290 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_189| v_ArrVal_11290) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= .cse1 (select .cse2 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))))) is different from false [2021-11-25 19:00:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:00:28,945 INFO L93 Difference]: Finished difference Result 5009 states and 11805 transitions. [2021-11-25 19:00:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 19:00:28,945 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:00:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:00:28,950 INFO L225 Difference]: With dead ends: 5009 [2021-11-25 19:00:28,950 INFO L226 Difference]: Without dead ends: 5009 [2021-11-25 19:00:28,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=468, Invalid=3007, Unknown=19, NotChecked=2358, Total=5852 [2021-11-25 19:00:28,951 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1421 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 5734 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8316 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:00:28,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1421 Valid, 96 Invalid, 14067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 5734 Invalid, 0 Unknown, 8316 Unchecked, 4.0s Time] [2021-11-25 19:00:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5009 states. [2021-11-25 19:00:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5009 to 3857. [2021-11-25 19:00:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3857 states, 3846 states have (on average 2.34789391575663) internal successors, (9030), 3856 states have internal predecessors, (9030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 9030 transitions. [2021-11-25 19:00:29,000 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 9030 transitions. Word has length 23 [2021-11-25 19:00:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:00:29,000 INFO L470 AbstractCegarLoop]: Abstraction has 3857 states and 9030 transitions. [2021-11-25 19:00:29,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 9030 transitions. [2021-11-25 19:00:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:00:29,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:00:29,003 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 19:00:29,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:00:29,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2021-11-25 19:00:29,203 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:00:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:00:29,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1683250246, now seen corresponding path program 11 times [2021-11-25 19:00:29,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:00:29,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137900857] [2021-11-25 19:00:29,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:00:29,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:00:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:00:29,666 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 19:00:29,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:00:29,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137900857] [2021-11-25 19:00:29,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137900857] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:00:29,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756282011] [2021-11-25 19:00:29,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:00:29,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:29,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:00:29,667 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:00:29,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 19:00:30,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:00:30,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:00:30,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 115 conjunts are in the unsatisfiable core [2021-11-25 19:00:30,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:00:30,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,417 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 19:00:30,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,423 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 19:00:30,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,433 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 19:00:30,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,440 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 19:00:30,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,446 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 19:00:30,465 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 19:00:30,466 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 88 treesize of output 82 [2021-11-25 19:00:30,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:30,472 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 19:00:30,481 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 19:00:30,920 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 15 treesize of output 7 [2021-11-25 19:00:31,064 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:00:31,065 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 85 treesize of output 66 [2021-11-25 19:00:31,068 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 19:00:31,141 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:00:31,141 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 37 treesize of output 34 [2021-11-25 19:00:31,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:31,298 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 35 treesize of output 31 [2021-11-25 19:00:31,340 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:00:31,340 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 19:00:31,343 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 19:00:31,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:00:31,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:31,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:31,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int)) (v_ArrVal_11496 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11496) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:31,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int)) (v_ArrVal_11496 (Array Int Int)) (v_ArrVal_11495 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_11495) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11496) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:31,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int)) (v_ArrVal_11496 (Array Int Int)) (v_ArrVal_11495 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_11495) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_11496) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:31,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int)) (v_ArrVal_11496 (Array Int Int)) (v_ArrVal_11495 (Array Int Int))) (or (not (= (select (select (store (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_11495) .cse0 v_ArrVal_11496))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|))) is different from false [2021-11-25 19:00:31,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int)) (v_ArrVal_11496 (Array Int Int)) (v_ArrVal_11495 (Array Int Int))) (or (not (= (select (select (store (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_11495) .cse0 v_ArrVal_11496))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|))) is different from false [2021-11-25 19:00:31,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int)) (v_ArrVal_11496 (Array Int Int)) (v_ArrVal_11495 (Array Int Int))) (or (not (= (select (select (store (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_11495) .cse0 v_ArrVal_11496))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|))) is different from false [2021-11-25 19:00:31,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int)) (v_ArrVal_11496 (Array Int Int)) (v_ArrVal_11495 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store (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_11495) .cse0 v_ArrVal_11496))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:00:31,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int)) (v_ArrVal_11496 (Array Int Int)) (v_ArrVal_11495 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store (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_11495) .cse0 v_ArrVal_11496))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:00:31,634 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 19:00:31,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756282011] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:00:31,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [591730615] [2021-11-25 19:00:31,635 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 19:00:31,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:00:31,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2021-11-25 19:00:31,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463565199] [2021-11-25 19:00:31,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:00:31,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 19:00:31,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:00:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 19:00:31,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=567, Unknown=10, NotChecked=570, Total=1260 [2021-11-25 19:00:31,638 INFO L87 Difference]: Start difference. First operand 3857 states and 9030 transitions. Second operand has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:33,593 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse0) (< .cse0 |c_#StackHeapBarrier|) (= (select .cse1 0) .cse0) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse0 0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))))) is different from false [2021-11-25 19:00:33,716 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= (select .cse1 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse0 0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))))) is different from false [2021-11-25 19:00:34,490 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse0 4))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| Int) (v_ArrVal_11497 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_191| v_ArrVal_11497) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (= (select .cse0 0) .cse1) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< (+ .cse1 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse1 0))))) is different from false [2021-11-25 19:00:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:00:36,302 INFO L93 Difference]: Finished difference Result 5283 states and 12296 transitions. [2021-11-25 19:00:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-25 19:00:36,303 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:00:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:00:36,309 INFO L225 Difference]: With dead ends: 5283 [2021-11-25 19:00:36,309 INFO L226 Difference]: Without dead ends: 5283 [2021-11-25 19:00:36,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=375, Invalid=1734, Unknown=13, NotChecked=1300, Total=3422 [2021-11-25 19:00:36,309 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 1242 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3833 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 8025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4105 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:00:36,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1242 Valid, 64 Invalid, 8025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3833 Invalid, 0 Unknown, 4105 Unchecked, 2.7s Time] [2021-11-25 19:00:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5283 states. [2021-11-25 19:00:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5283 to 3762. [2021-11-25 19:00:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3762 states, 3751 states have (on average 2.34950679818715) internal successors, (8813), 3761 states have internal predecessors, (8813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3762 states and 8813 transitions. [2021-11-25 19:00:36,359 INFO L78 Accepts]: Start accepts. Automaton has 3762 states and 8813 transitions. Word has length 23 [2021-11-25 19:00:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:00:36,359 INFO L470 AbstractCegarLoop]: Abstraction has 3762 states and 8813 transitions. [2021-11-25 19:00:36,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3762 states and 8813 transitions. [2021-11-25 19:00:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:00:36,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:00:36,361 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 19:00:36,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 19:00:36,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:36,562 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:00:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:00:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1591196056, now seen corresponding path program 12 times [2021-11-25 19:00:36,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:00:36,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884199903] [2021-11-25 19:00:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:00:36,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:00:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:00:37,228 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 19:00:37,228 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:00:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884199903] [2021-11-25 19:00:37,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884199903] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:00:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537477193] [2021-11-25 19:00:37,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:00:37,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:00:37,230 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:00:37,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 19:00:37,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:00:37,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:00:37,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 119 conjunts are in the unsatisfiable core [2021-11-25 19:00:37,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:00:37,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:37,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:37,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:37,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:37,898 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 19:00:37,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:37,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:37,905 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 19:00:37,913 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 68 treesize of output 66 [2021-11-25 19:00:37,932 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 19:00:37,932 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 156 treesize of output 128 [2021-11-25 19:00:37,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:37,938 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 19:00:38,514 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 15 treesize of output 7 [2021-11-25 19:00:38,668 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:00:38,668 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 85 treesize of output 66 [2021-11-25 19:00:38,671 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 19:00:38,746 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:00:38,746 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 37 treesize of output 34 [2021-11-25 19:00:38,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:38,909 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 35 treesize of output 31 [2021-11-25 19:00:38,954 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:00:38,954 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 19:00:38,956 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 19:00:38,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:00:38,969 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:38,979 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,033 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11702) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (v_ArrVal_11701 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_11701) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11702) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:39,064 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (v_ArrVal_11701 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_11701) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_11702) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (v_ArrVal_11701 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store (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_11701) .cse0 v_ArrVal_11702))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int) (v_ArrVal_11701 (Array Int Int))) (or (not (= (select (select (store (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_11701) .cse0 v_ArrVal_11702))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (v_ArrVal_11701 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store (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_11701) .cse0 v_ArrVal_11702))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (v_ArrVal_11701 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store (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_11701) .cse0 v_ArrVal_11702))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (v_ArrVal_11701 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store (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_11701) .cse0 v_ArrVal_11702))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11703 (Array Int Int)) (v_ArrVal_11702 (Array Int Int)) (v_ArrVal_11701 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store (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_11701) .cse0 v_ArrVal_11702))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) is different from false [2021-11-25 19:00:39,161 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 19:00:39,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537477193] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:00:39,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [961955379] [2021-11-25 19:00:39,162 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 19:00:39,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:00:39,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 41 [2021-11-25 19:00:39,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201604987] [2021-11-25 19:00:39,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:00:39,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-25 19:00:39,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:00:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-25 19:00:39,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=853, Unknown=11, NotChecked=770, Total=1806 [2021-11-25 19:00:39,165 INFO L87 Difference]: Start difference. First operand 3762 states and 8813 transitions. Second operand has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:41,617 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse5 (not (= (select .cse9 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse3 (select .cse4 4)) (.cse7 (and (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) .cse5)) (.cse6 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse8 (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0))) (and (not (= |c_pusherThread1of1ForFork0_~q~0#1.base| (select .cse0 4))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse3) (< .cse3 |c_#StackHeapBarrier|) (= (select .cse4 0) .cse3) .cse5 (<= .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse6 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 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|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (or .cse7 (and .cse6 (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| 0) (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= .cse3 0)) (forall ((v_ArrVal_11703 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) (not (= (select .cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (or .cse7 (let ((.cse10 (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse10) 0) .cse6 (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse10) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) .cse8))) (not (= (select .cse2 4) |c_pusherThread1of1ForFork0_#in~q_#1.base|)) .cse8 (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0))))) is different from false [2021-11-25 19:00:41,997 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= (select .cse1 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse0 0)) (forall ((v_ArrVal_11703 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|)))))) is different from false [2021-11-25 19:00:42,957 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse0 4))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= (select .cse0 0) .cse1) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< (+ .cse1 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_11703 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193| v_ArrVal_11703) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_193|))) (not (= .cse1 0))))) is different from false [2021-11-25 19:00:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:00:48,488 INFO L93 Difference]: Finished difference Result 5744 states and 13302 transitions. [2021-11-25 19:00:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-25 19:00:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:00:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:00:48,495 INFO L225 Difference]: With dead ends: 5744 [2021-11-25 19:00:48,495 INFO L226 Difference]: Without dead ends: 5744 [2021-11-25 19:00:48,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 95 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1281, Invalid=5567, Unknown=14, NotChecked=2450, Total=9312 [2021-11-25 19:00:48,496 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 2823 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 6616 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2823 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 6616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6130 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:00:48,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2823 Valid, 68 Invalid, 13040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 6616 Invalid, 0 Unknown, 6130 Unchecked, 4.9s Time] [2021-11-25 19:00:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2021-11-25 19:00:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 3809. [2021-11-25 19:00:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3798 states have (on average 2.358083201685097) internal successors, (8956), 3808 states have internal predecessors, (8956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 8956 transitions. [2021-11-25 19:00:48,547 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 8956 transitions. Word has length 23 [2021-11-25 19:00:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:00:48,547 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 8956 transitions. [2021-11-25 19:00:48,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 8956 transitions. [2021-11-25 19:00:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:00:48,549 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:00:48,549 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 19:00:48,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 19:00:48,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:48,752 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:00:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:00:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1792963560, now seen corresponding path program 13 times [2021-11-25 19:00:48,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:00:48,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54754377] [2021-11-25 19:00:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:00:48,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:00:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:00:49,492 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 19:00:49,492 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:00:49,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54754377] [2021-11-25 19:00:49,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54754377] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:00:49,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276022471] [2021-11-25 19:00:49,492 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:00:49,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:00:49,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:00:49,493 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:00:49,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 19:00:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:00:50,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 113 conjunts are in the unsatisfiable core [2021-11-25 19:00:50,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:00:50,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,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 19:00:50,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,151 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 19:00:50,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,157 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 19:00:50,175 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 19:00:50,175 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 113 treesize of output 95 [2021-11-25 19:00:50,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:50,181 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 19:00:50,733 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 65 treesize of output 49 [2021-11-25 19:00:50,896 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:00:50,896 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 19:00:50,902 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-25 19:00:50,902 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 19:00:50,980 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:00:50,980 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 37 treesize of output 34 [2021-11-25 19:00:51,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:00:51,145 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 35 treesize of output 31 [2021-11-25 19:00:51,191 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:00:51,191 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 19:00:51,193 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 19:00:51,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:00:51,206 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|))) is different from false [2021-11-25 19:00:51,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|))) is different from false [2021-11-25 19:00:51,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int)) (v_ArrVal_11907 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11907) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|))) is different from false [2021-11-25 19:00:51,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int)) (v_ArrVal_11907 (Array Int Int)) (v_ArrVal_11906 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_11906) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_11907) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|))) is different from false [2021-11-25 19:00:51,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int)) (v_ArrVal_11907 (Array Int Int)) (v_ArrVal_11906 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_11906) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_11907) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|))) is different from false [2021-11-25 19:00:51,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int)) (v_ArrVal_11907 (Array Int Int)) (v_ArrVal_11906 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|) (not (= (select (select (store (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_11906) .cse0 v_ArrVal_11907))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:00:51,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int)) (v_ArrVal_11907 (Array Int Int)) (v_ArrVal_11906 (Array Int Int))) (or (not (= (select (select (store (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_11906) .cse0 v_ArrVal_11907))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|))) is different from false [2021-11-25 19:00:51,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int)) (v_ArrVal_11907 (Array Int Int)) (v_ArrVal_11906 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|) (not (= (select (select (store (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_11906) .cse0 v_ArrVal_11907))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:00:51,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int)) (v_ArrVal_11907 (Array Int Int)) (v_ArrVal_11906 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|) (not (= (select (select (store (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_11906) .cse0 v_ArrVal_11907))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:00:51,447 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int)) (v_ArrVal_11907 (Array Int Int)) (v_ArrVal_11906 (Array Int Int))) (or (not (= (select (select (store (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_11906) .cse0 v_ArrVal_11907))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|))) is different from false [2021-11-25 19:00:51,449 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 19:00:51,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276022471] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:00:51,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [974536169] [2021-11-25 19:00:51,450 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 19:00:51,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:00:51,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 12] total 40 [2021-11-25 19:00:51,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792369356] [2021-11-25 19:00:51,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:00:51,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-25 19:00:51,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:00:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-25 19:00:51,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=858, Unknown=10, NotChecked=690, Total=1722 [2021-11-25 19:00:51,453 INFO L87 Difference]: Start difference. First operand 3809 states and 8956 transitions. Second operand has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:00:54,008 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 0))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 4)) (< .cse0 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (and (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (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_~t~0#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0))) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|)))))) is different from false [2021-11-25 19:00:54,503 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 4)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|)))))) is different from false [2021-11-25 19:00:56,031 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 0))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (< (+ .cse0 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 4)) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| Int) (v_ArrVal_11908 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195| v_ArrVal_11908) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_195|)))))) is different from false [2021-11-25 19:01:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:00,372 INFO L93 Difference]: Finished difference Result 6713 states and 15779 transitions. [2021-11-25 19:01:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-25 19:01:00,373 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:01:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:00,380 INFO L225 Difference]: With dead ends: 6713 [2021-11-25 19:01:00,380 INFO L226 Difference]: Without dead ends: 6713 [2021-11-25 19:01:00,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 28 SyntacticMatches, 22 SemanticMatches, 79 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=732, Invalid=3863, Unknown=13, NotChecked=1872, Total=6480 [2021-11-25 19:01:00,381 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 1437 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 6779 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 14040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 6779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7187 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:00,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 74 Invalid, 14040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 6779 Invalid, 0 Unknown, 7187 Unchecked, 4.9s Time] [2021-11-25 19:01:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2021-11-25 19:01:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 4500. [2021-11-25 19:01:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4500 states, 4489 states have (on average 2.401871240810871) internal successors, (10782), 4499 states have internal predecessors, (10782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4500 states to 4500 states and 10782 transitions. [2021-11-25 19:01:00,443 INFO L78 Accepts]: Start accepts. Automaton has 4500 states and 10782 transitions. Word has length 23 [2021-11-25 19:01:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:00,443 INFO L470 AbstractCegarLoop]: Abstraction has 4500 states and 10782 transitions. [2021-11-25 19:01:00,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 10782 transitions. [2021-11-25 19:01:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:00,446 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:00,446 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 19:01:00,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:01:00,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:00,647 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash 101685858, now seen corresponding path program 14 times [2021-11-25 19:01:00,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:00,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105977379] [2021-11-25 19:01:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:00,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:01,017 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 19:01:01,017 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:01,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105977379] [2021-11-25 19:01:01,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105977379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:01:01,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:01:01,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:01:01,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009261590] [2021-11-25 19:01:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:01:01,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:01:01,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:01,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:01:01,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:01:01,063 INFO L87 Difference]: Start difference. First operand 4500 states and 10782 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:03,223 INFO L93 Difference]: Finished difference Result 4985 states and 11807 transitions. [2021-11-25 19:01:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 19:01:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:03,229 INFO L225 Difference]: With dead ends: 4985 [2021-11-25 19:01:03,229 INFO L226 Difference]: Without dead ends: 4985 [2021-11-25 19:01:03,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:01:03,230 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 264 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:03,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 52 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 19:01:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2021-11-25 19:01:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4597. [2021-11-25 19:01:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 4586 states have (on average 2.3966419537723507) internal successors, (10991), 4596 states have internal predecessors, (10991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 10991 transitions. [2021-11-25 19:01:03,285 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 10991 transitions. Word has length 23 [2021-11-25 19:01:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:03,285 INFO L470 AbstractCegarLoop]: Abstraction has 4597 states and 10991 transitions. [2021-11-25 19:01:03,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 10991 transitions. [2021-11-25 19:01:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:03,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:03,288 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 19:01:03,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-11-25 19:01:03,288 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:03,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1263555986, now seen corresponding path program 9 times [2021-11-25 19:01:03,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:03,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310073612] [2021-11-25 19:01:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:03,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:03,624 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 19:01:03,624 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:03,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310073612] [2021-11-25 19:01:03,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310073612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:01:03,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:01:03,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:01:03,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884219486] [2021-11-25 19:01:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:01:03,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:01:03,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:03,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:01:03,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:01:03,626 INFO L87 Difference]: Start difference. First operand 4597 states and 10991 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:05,710 INFO L93 Difference]: Finished difference Result 4682 states and 11144 transitions. [2021-11-25 19:01:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 19:01:05,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:05,716 INFO L225 Difference]: With dead ends: 4682 [2021-11-25 19:01:05,716 INFO L226 Difference]: Without dead ends: 4682 [2021-11-25 19:01:05,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:01:05,717 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 331 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:05,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 32 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 19:01:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2021-11-25 19:01:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4512. [2021-11-25 19:01:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 4501 states have (on average 2.401244167962675) internal successors, (10808), 4511 states have internal predecessors, (10808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 10808 transitions. [2021-11-25 19:01:05,773 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 10808 transitions. Word has length 23 [2021-11-25 19:01:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:05,774 INFO L470 AbstractCegarLoop]: Abstraction has 4512 states and 10808 transitions. [2021-11-25 19:01:05,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 10808 transitions. [2021-11-25 19:01:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:05,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:05,781 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 19:01:05,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-11-25 19:01:05,781 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:05,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1646714486, now seen corresponding path program 15 times [2021-11-25 19:01:05,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:05,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391222303] [2021-11-25 19:01:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:05,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:06,015 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 19:01:06,015 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:06,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391222303] [2021-11-25 19:01:06,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391222303] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:01:06,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587631041] [2021-11-25 19:01:06,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:01:06,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:06,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:01:06,016 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:01:06,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 19:01:06,669 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:01:06,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:01:06,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-25 19:01:06,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:01:06,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,724 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 19:01:06,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,736 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 19:01:06,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,747 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 19:01:06,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,754 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 19:01:06,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:06,769 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-25 19:01:06,769 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 92 [2021-11-25 19:01:07,203 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 83 treesize of output 59 [2021-11-25 19:01:07,457 INFO L354 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2021-11-25 19:01:07,457 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 91 treesize of output 72 [2021-11-25 19:01:07,463 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-25 19:01:07,463 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 19:01:07,538 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 19:01:07,538 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 37 treesize of output 34 [2021-11-25 19:01:07,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:07,720 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 35 treesize of output 31 [2021-11-25 19:01:07,764 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:01:07,764 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 19:01:07,786 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 19:01:07,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:01:07,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) is different from false [2021-11-25 19:01:07,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) is different from false [2021-11-25 19:01:07,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int)) (v_ArrVal_12285 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_12285) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) is different from false [2021-11-25 19:01:07,924 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12284 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int)) (v_ArrVal_12285 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_12284) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_12285) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:01:07,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12284 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int)) (v_ArrVal_12285 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_12284) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12285) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:01:07,958 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12284 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int)) (v_ArrVal_12285 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_12284) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12285) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:01:07,970 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12284 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int)) (v_ArrVal_12285 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|) (not (= (select (select (store (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_12284) .cse0 v_ArrVal_12285))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:01:08,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12284 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int)) (v_ArrVal_12285 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|) (not (= (select (select (store (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_12284) .cse0 v_ArrVal_12285))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:01:08,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12284 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int)) (v_ArrVal_12285 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|) (not (= (select (select (store (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_12284) .cse0 v_ArrVal_12285))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:01:08,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12284 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int)) (v_ArrVal_12285 (Array Int Int))) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|) (not (= (select (select (store (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_12284) .cse0 v_ArrVal_12285))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2021-11-25 19:01:08,039 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 19:01:08,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587631041] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:01:08,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1297929316] [2021-11-25 19:01:08,040 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 19:01:08,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:01:08,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 34 [2021-11-25 19:01:08,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280989386] [2021-11-25 19:01:08,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:01:08,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 19:01:08,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 19:01:08,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=536, Unknown=10, NotChecked=550, Total=1190 [2021-11-25 19:01:08,042 INFO L87 Difference]: Start difference. First operand 4512 states and 10808 transitions. Second operand has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:10,177 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select .cse1 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< .cse0 |c_#StackHeapBarrier|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse0)))) is different from false [2021-11-25 19:01:10,223 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select .cse1 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< .cse0 |c_#StackHeapBarrier|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|)))) is different from false [2021-11-25 19:01:10,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select .cse1 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< .cse0 |c_#StackHeapBarrier|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|)))))) is different from false [2021-11-25 19:01:10,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse0 (select .cse2 4)) (.cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= 0 .cse0)) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select .cse2 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< .cse0 |c_#StackHeapBarrier|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)))) is different from false [2021-11-25 19:01:10,383 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= (select .cse1 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) (not (= .cse0 0))))) is different from false [2021-11-25 19:01:10,479 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse2 4)) (.cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select .cse2 0) .cse0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)))) is different from false [2021-11-25 19:01:10,814 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse0 4))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| Int) (v_ArrVal_12286 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197| v_ArrVal_12286) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_197|))) (= (select .cse0 0) .cse1) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (< (+ .cse1 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse1 0))))) is different from false [2021-11-25 19:01:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:12,664 INFO L93 Difference]: Finished difference Result 5228 states and 12468 transitions. [2021-11-25 19:01:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 19:01:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 19:01:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:12,671 INFO L225 Difference]: With dead ends: 5228 [2021-11-25 19:01:12,671 INFO L226 Difference]: Without dead ends: 5228 [2021-11-25 19:01:12,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 17 IntricatePredicates, 4 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=363, Invalid=2138, Unknown=17, NotChecked=1904, Total=4422 [2021-11-25 19:01:12,671 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 964 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 10070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5848 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:12,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [964 Valid, 100 Invalid, 10070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4139 Invalid, 0 Unknown, 5848 Unchecked, 2.6s Time] [2021-11-25 19:01:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2021-11-25 19:01:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 4592. [2021-11-25 19:01:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4592 states, 4581 states have (on average 2.4027504911591357) internal successors, (11007), 4591 states have internal predecessors, (11007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4592 states to 4592 states and 11007 transitions. [2021-11-25 19:01:12,756 INFO L78 Accepts]: Start accepts. Automaton has 4592 states and 11007 transitions. Word has length 23 [2021-11-25 19:01:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:12,756 INFO L470 AbstractCegarLoop]: Abstraction has 4592 states and 11007 transitions. [2021-11-25 19:01:12,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4592 states and 11007 transitions. [2021-11-25 19:01:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:12,758 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:12,759 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 19:01:12,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 19:01:12,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2021-11-25 19:01:12,959 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash -209094870, now seen corresponding path program 16 times [2021-11-25 19:01:12,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:12,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025765951] [2021-11-25 19:01:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:12,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:13,226 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 19:01:13,226 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:13,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025765951] [2021-11-25 19:01:13,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025765951] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:01:13,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150663895] [2021-11-25 19:01:13,227 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:01:13,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:01:13,228 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:01:13,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 19:01:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:13,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 114 conjunts are in the unsatisfiable core [2021-11-25 19:01:13,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:01:13,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,893 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 19:01:13,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,900 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 19:01:13,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,905 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 19:01:13,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,911 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 19:01:13,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:13,915 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 19:01:14,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:14,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:14,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:14,567 INFO L354 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2021-11-25 19:01:14,567 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 58 [2021-11-25 19:01:14,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:14,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:14,603 INFO L354 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-11-25 19:01:14,604 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 47 [2021-11-25 19:01:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:14,800 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2021-11-25 19:01:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:14,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2021-11-25 19:01:15,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:15,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:15,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2021-11-25 19:01:15,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:15,164 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 35 treesize of output 31 [2021-11-25 19:01:15,204 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:01:15,205 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 19:01:15,237 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 19:01:15,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:01:15,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12490 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:01:15,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (v_ArrVal_12490 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_12488))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (and (forall ((v_ArrVal_12489 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_12489) |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| (select (select .cse0 |c_ULTIMATE.start_fifo_empty_~self#1.base|) (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))) is different from false [2021-11-25 19:01:16,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse0 (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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_12488))) (or (and (= (select (select .cse0 |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.base|) (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_12489) |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|))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))) is different from false [2021-11-25 19:01:16,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse0 (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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12488))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (and (= (select (select .cse0 |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.base|) (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12489) |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_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))) is different from false [2021-11-25 19:01:16,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse0 (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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12488))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (and (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12489) |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (= (select (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))) is different from false [2021-11-25 19:01:16,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse0 (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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12488))) (or (and (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))) is different from false [2021-11-25 19:01:16,928 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (let ((.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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) .cse0 v_ArrVal_12488))) (or (not (= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))))) is different from false [2021-11-25 19:01:17,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse1 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1))) (let ((.cse0 (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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) .cse2 v_ArrVal_12488))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (and (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)))) (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) .cse2)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))))) is different from false [2021-11-25 19:01:18,066 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse2 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2))) (let ((.cse0 (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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) .cse1 v_ArrVal_12488))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|) (and (= (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2021-11-25 19:01:18,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse4 (select .cse2 .cse5))) (let ((.cse0 (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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) .cse4 v_ArrVal_12488))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse5))) (or (not (= 0 (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1)))) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3)) (not (= .cse4 .cse3)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|))))))) is different from false [2021-11-25 19:01:18,278 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 19:01:18,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150663895] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:01:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [280309997] [2021-11-25 19:01:18,279 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 19:01:18,280 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:01:18,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 15] total 38 [2021-11-25 19:01:18,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735495577] [2021-11-25 19:01:18,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:01:18,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 19:01:18,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:18,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 19:01:18,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=716, Unknown=11, NotChecked=630, Total=1482 [2021-11-25 19:01:18,282 INFO L87 Difference]: Start difference. First operand 4592 states and 11007 transitions. Second operand has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:18,493 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (let ((.cse4 (select .cse2 .cse5))) (let ((.cse0 (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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) .cse4 v_ArrVal_12488))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse5))) (or (not (= 0 (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1)))) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3)) (not (= .cse4 .cse3)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|))))))) (= (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse6 .cse7) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse8 0)) (< .cse8 |c_#StackHeapBarrier|) (= (select .cse9 .cse7) .cse8)))) is different from false [2021-11-25 19:01:18,497 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse5 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse5))) (let ((.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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) .cse4 v_ArrVal_12488))) (or (not (= (select (select (store .cse3 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse4 (select (select .cse3 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse5))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|) (and (= (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) (< .cse2 |c_#StackHeapBarrier|) (= (select .cse6 .cse1) .cse2)))) is different from false [2021-11-25 19:01:18,502 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse3 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (let ((.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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) .cse4 v_ArrVal_12488))) (or (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (and (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)))) (not (= (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) .cse4)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))))) (not (= .cse5 0)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (< .cse5 |c_#StackHeapBarrier|) (= (select .cse6 .cse1) .cse5)))) is different from false [2021-11-25 19:01:18,507 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse2 0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.cse5 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse5))) (let ((.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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) .cse3 v_ArrVal_12488))) (or (not (= .cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse5))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4))) (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))))) (= |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|) (< .cse2 |c_#StackHeapBarrier|) (= (select .cse6 .cse1) .cse2)))) is different from false [2021-11-25 19:01:18,529 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|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse1 .cse2) 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse3 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= (select .cse0 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12488))) (or (and (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12489) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)))) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))) (< .cse3 |c_#StackHeapBarrier|) (= (select .cse5 .cse2) .cse3)))) is different from false [2021-11-25 19:01:18,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse3 0)) (.cse2 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select .cse0 4) 0) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (= .cse1 (select .cse3 4)) (< .cse1 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= (select .cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (= (select .cse0 0) 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12488))) (or (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (and (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12489) |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (= (select (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|))))))) is different from false [2021-11-25 19:01:18,558 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (and (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select .cse0 4) 0) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= .cse1 (select .cse2 4)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12488))) (or (not (= (select (select (store .cse3 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (and (= (select (select .cse3 |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.base|) (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| v_ArrVal_12489) |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_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) (< .cse1 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|)))) is different from false [2021-11-25 19:01:18,575 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse3 0)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select .cse0 4) 0) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| Int) (v_ArrVal_12488 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (v_ArrVal_12490 (Array Int Int)) (v_ArrVal_12484 Int)) (let ((.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|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12484)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_12488))) (or (and (= (select (select .cse2 |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.base|) (forall ((v_ArrVal_12489 (Array Int Int)) (v_ArrVal_12486 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_12486)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_12489) |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|))) (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199| v_ArrVal_12490) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_199|)))) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= .cse1 (select .cse3 4)) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) (< .cse1 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|)))) is different from false [2021-11-25 19:01:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:19,942 INFO L93 Difference]: Finished difference Result 4854 states and 11597 transitions. [2021-11-25 19:01:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:01:19,943 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 19:01:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:19,949 INFO L225 Difference]: With dead ends: 4854 [2021-11-25 19:01:19,949 INFO L226 Difference]: Without dead ends: 4854 [2021-11-25 19:01:19,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=199, Invalid=1186, Unknown=19, NotChecked=1566, Total=2970 [2021-11-25 19:01:19,950 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1889 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:19,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 106 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1853 Invalid, 0 Unknown, 1889 Unchecked, 1.2s Time] [2021-11-25 19:01:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4854 states. [2021-11-25 19:01:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4854 to 4604. [2021-11-25 19:01:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4604 states, 4593 states have (on average 2.4023514043109078) internal successors, (11034), 4603 states have internal predecessors, (11034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 11034 transitions. [2021-11-25 19:01:20,005 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 11034 transitions. Word has length 23 [2021-11-25 19:01:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:20,005 INFO L470 AbstractCegarLoop]: Abstraction has 4604 states and 11034 transitions. [2021-11-25 19:01:20,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 11034 transitions. [2021-11-25 19:01:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:20,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:20,008 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 19:01:20,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-25 19:01:20,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2021-11-25 19:01:20,211 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1596246932, now seen corresponding path program 17 times [2021-11-25 19:01:20,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:20,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031601033] [2021-11-25 19:01:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:20,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:20,510 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 19:01:20,510 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031601033] [2021-11-25 19:01:20,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031601033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:01:20,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:01:20,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-25 19:01:20,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930128260] [2021-11-25 19:01:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:01:20,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:01:20,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:01:20,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:01:20,511 INFO L87 Difference]: Start difference. First operand 4604 states and 11034 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:22,538 INFO L93 Difference]: Finished difference Result 5117 states and 12122 transitions. [2021-11-25 19:01:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 19:01:22,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:22,544 INFO L225 Difference]: With dead ends: 5117 [2021-11-25 19:01:22,545 INFO L226 Difference]: Without dead ends: 5117 [2021-11-25 19:01:22,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-11-25 19:01:22,545 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 379 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:22,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 38 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 19:01:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2021-11-25 19:01:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 4695. [2021-11-25 19:01:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4695 states, 4684 states have (on average 2.3983774551665245) internal successors, (11234), 4694 states have internal predecessors, (11234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 11234 transitions. [2021-11-25 19:01:22,603 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 11234 transitions. Word has length 23 [2021-11-25 19:01:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:22,603 INFO L470 AbstractCegarLoop]: Abstraction has 4695 states and 11234 transitions. [2021-11-25 19:01:22,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 19:01:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 11234 transitions. [2021-11-25 19:01:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:22,607 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:22,608 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 19:01:22,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-11-25 19:01:22,608 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:22,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 261860568, now seen corresponding path program 10 times [2021-11-25 19:01:22,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:22,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463160348] [2021-11-25 19:01:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:22,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:23,188 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 19:01:23,189 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:23,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463160348] [2021-11-25 19:01:23,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463160348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:01:23,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:01:23,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-25 19:01:23,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925451580] [2021-11-25 19:01:23,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:01:23,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 19:01:23,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:23,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 19:01:23,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-25 19:01:23,190 INFO L87 Difference]: Start difference. First operand 4695 states and 11234 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 19:01:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:25,893 INFO L93 Difference]: Finished difference Result 5106 states and 12044 transitions. [2021-11-25 19:01:25,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:01:25,894 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 19:01:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:25,901 INFO L225 Difference]: With dead ends: 5106 [2021-11-25 19:01:25,901 INFO L226 Difference]: Without dead ends: 5033 [2021-11-25 19:01:25,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2021-11-25 19:01:25,902 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 377 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 3363 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:25,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 41 Invalid, 3391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3363 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 19:01:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2021-11-25 19:01:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 4672. [2021-11-25 19:01:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4672 states, 4661 states have (on average 2.400128727740828) internal successors, (11187), 4671 states have internal predecessors, (11187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 11187 transitions. [2021-11-25 19:01:25,960 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 11187 transitions. Word has length 23 [2021-11-25 19:01:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:25,960 INFO L470 AbstractCegarLoop]: Abstraction has 4672 states and 11187 transitions. [2021-11-25 19:01:25,960 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 19:01:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 11187 transitions. [2021-11-25 19:01:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:25,964 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:25,964 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 19:01:25,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-11-25 19:01:25,964 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash -408989238, now seen corresponding path program 18 times [2021-11-25 19:01:25,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:25,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110343392] [2021-11-25 19:01:25,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:25,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:26,767 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 19:01:26,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:26,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110343392] [2021-11-25 19:01:26,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110343392] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:01:26,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610040781] [2021-11-25 19:01:26,767 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:01:26,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:26,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:01:26,768 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:01:26,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 19:01:27,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:01:27,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:01:27,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 100 conjunts are in the unsatisfiable core [2021-11-25 19:01:27,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:01:27,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,454 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 19:01:27,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,464 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 19:01:27,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,470 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 19:01:27,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,474 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 19:01:27,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,480 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 19:01:27,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:27,890 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 19:01:27,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:27,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:27,897 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 19:01:28,027 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 19:01:28,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:01:28,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610040781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:01:28,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:01:28,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 27 [2021-11-25 19:01:28,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244217637] [2021-11-25 19:01:28,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:01:28,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 19:01:28,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:28,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 19:01:28,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:01:28,028 INFO L87 Difference]: Start difference. First operand 4672 states and 11187 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 19:01:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:30,366 INFO L93 Difference]: Finished difference Result 4952 states and 11759 transitions. [2021-11-25 19:01:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:01:30,366 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 19:01:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:30,400 INFO L225 Difference]: With dead ends: 4952 [2021-11-25 19:01:30,400 INFO L226 Difference]: Without dead ends: 4952 [2021-11-25 19:01:30,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:01:30,401 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 289 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:30,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 40 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 19:01:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4952 states. [2021-11-25 19:01:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4952 to 4670. [2021-11-25 19:01:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4670 states, 4659 states have (on average 2.399441940330543) internal successors, (11179), 4669 states have internal predecessors, (11179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 11179 transitions. [2021-11-25 19:01:30,453 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 11179 transitions. Word has length 23 [2021-11-25 19:01:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:30,454 INFO L470 AbstractCegarLoop]: Abstraction has 4670 states and 11179 transitions. [2021-11-25 19:01:30,454 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 19:01:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 11179 transitions. [2021-11-25 19:01:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:30,457 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:30,457 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 19:01:30,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 19:01:30,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2021-11-25 19:01:30,658 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1279238924, now seen corresponding path program 19 times [2021-11-25 19:01:30,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:30,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699533290] [2021-11-25 19:01:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:30,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:30,987 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 19:01:30,987 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699533290] [2021-11-25 19:01:30,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699533290] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:01:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033632337] [2021-11-25 19:01:30,987 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:01:30,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:01:30,988 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:01:30,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 19:01:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:31,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-25 19:01:31,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:01:31,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:31,732 INFO L354 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2021-11-25 19:01:31,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 77 [2021-11-25 19:01:31,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:31,876 INFO L354 Elim1Store]: treesize reduction 311, result has 12.6 percent of original size [2021-11-25 19:01:31,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 67 [2021-11-25 19:01:31,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:31,902 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-25 19:01:31,902 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 136 [2021-11-25 19:01:31,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:31,917 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 19:01:31,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:31,930 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 19:01:31,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:31,943 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 25 treesize of output 29 [2021-11-25 19:01:32,112 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-25 19:01:32,112 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 19:01:32,223 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-25 19:01:32,223 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2021-11-25 19:01:32,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:32,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-11-25 19:01:32,263 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 49 treesize of output 39 [2021-11-25 19:01:32,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:32,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2021-11-25 19:01:33,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:33,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:33,566 INFO L354 Elim1Store]: treesize reduction 30, result has 85.2 percent of original size [2021-11-25 19:01:33,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 10 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 39 case distinctions, treesize of input 152 treesize of output 221 [2021-11-25 19:01:36,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:36,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:36,300 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 19:01:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:36,457 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 16 treesize of output 18 [2021-11-25 19:01:36,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:36,460 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 16 treesize of output 18 [2021-11-25 19:01:36,467 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 19:01:36,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:01:36,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201|) (and (forall ((v_ArrVal_13064 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13064) |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|)) (forall ((v_ArrVal_13063 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13063) |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.base|))))) is different from false [2021-11-25 19:01:36,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201|) (and (forall ((v_ArrVal_13064 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13064) |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|)) (forall ((v_ArrVal_13063 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13063) |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.base|))))) is different from false [2021-11-25 19:01:36,602 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:01:36,602 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 19:01:36,610 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:01:36,610 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 19:01:36,614 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 19:01:36,617 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 19:01:37,069 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 19:01:37,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033632337] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:01:37,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [247874891] [2021-11-25 19:01:37,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 19:01:37,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:01:37,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2021-11-25 19:01:37,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765848955] [2021-11-25 19:01:37,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:01:37,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-25 19:01:37,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:37,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-25 19:01:37,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=734, Unknown=29, NotChecked=114, Total=992 [2021-11-25 19:01:37,072 INFO L87 Difference]: Start difference. First operand 4670 states and 11179 transitions. Second operand has 32 states, 32 states have (on average 1.78125) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:37,517 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (<= .cse0 |c_ULTIMATE.start_fifo_empty_~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 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201|) (and (forall ((v_ArrVal_13064 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13064) |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|)) (forall ((v_ArrVal_13063 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13063) |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.base|))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) is different from false [2021-11-25 19:01:37,550 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201|) (and (forall ((v_ArrVal_13064 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13064) |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|)) (forall ((v_ArrVal_13063 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13063) |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.base|))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))) is different from false [2021-11-25 19:01:37,657 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201|) (and (forall ((v_ArrVal_13064 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13064) |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|)) (forall ((v_ArrVal_13063 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_201| v_ArrVal_13063) |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.base|))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0) |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 19:01:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:38,105 INFO L93 Difference]: Finished difference Result 4767 states and 11404 transitions. [2021-11-25 19:01:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-25 19:01:38,105 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.78125) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 19:01:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:38,111 INFO L225 Difference]: With dead ends: 4767 [2021-11-25 19:01:38,111 INFO L226 Difference]: Without dead ends: 4767 [2021-11-25 19:01:38,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=146, Invalid=898, Unknown=32, NotChecked=330, Total=1406 [2021-11-25 19:01:38,112 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 705 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:38,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 60 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1320 Invalid, 0 Unknown, 705 Unchecked, 0.8s Time] [2021-11-25 19:01:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4767 states. [2021-11-25 19:01:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4767 to 4677. [2021-11-25 19:01:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4677 states, 4666 states have (on average 2.4001285897985425) internal successors, (11199), 4676 states have internal predecessors, (11199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4677 states to 4677 states and 11199 transitions. [2021-11-25 19:01:38,166 INFO L78 Accepts]: Start accepts. Automaton has 4677 states and 11199 transitions. Word has length 23 [2021-11-25 19:01:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:38,166 INFO L470 AbstractCegarLoop]: Abstraction has 4677 states and 11199 transitions. [2021-11-25 19:01:38,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.78125) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4677 states and 11199 transitions. [2021-11-25 19:01:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:38,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:38,169 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 19:01:38,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 19:01:38,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:38,370 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash -324275122, now seen corresponding path program 20 times [2021-11-25 19:01:38,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:38,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043707179] [2021-11-25 19:01:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:38,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:40,110 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 19:01:40,110 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:40,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043707179] [2021-11-25 19:01:40,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043707179] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:01:40,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250927434] [2021-11-25 19:01:40,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:01:40,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:01:40,112 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:01:40,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 19:01:40,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:01:40,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:01:40,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 141 conjunts are in the unsatisfiable core [2021-11-25 19:01:40,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:01:40,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:40,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:40,886 INFO L354 Elim1Store]: treesize reduction 74, result has 18.7 percent of original size [2021-11-25 19:01:40,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 48 [2021-11-25 19:01:40,902 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-25 19:01:40,903 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 95 treesize of output 77 [2021-11-25 19:01:40,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:40,908 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 19:01:41,398 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 19:01:41,720 INFO L354 Elim1Store]: treesize reduction 60, result has 26.8 percent of original size [2021-11-25 19:01:41,721 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 95 treesize of output 89 [2021-11-25 19:01:41,751 INFO L354 Elim1Store]: treesize reduction 61, result has 9.0 percent of original size [2021-11-25 19:01:41,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2021-11-25 19:01:41,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:41,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:41,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:41,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2021-11-25 19:01:42,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:42,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:42,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:42,233 INFO L354 Elim1Store]: treesize reduction 316, result has 11.7 percent of original size [2021-11-25 19:01:42,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 24 case distinctions, treesize of input 119 treesize of output 86 [2021-11-25 19:01:42,741 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 172 treesize of output 160 [2021-11-25 19:01:42,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:42,933 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-25 19:01:42,933 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2021-11-25 19:01:42,949 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 13 treesize of output 9 [2021-11-25 19:01:43,026 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:01:43,026 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 19:01:43,074 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 19:01:43,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:01:43,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|))) is different from false [2021-11-25 19:01:43,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2021-11-25 19:01:43,448 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:01:43,448 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 39 treesize of output 42 [2021-11-25 19:01:44,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_383 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_13263))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_383))) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse1 (select (select .cse0 .cse1) (+ v_arrayElimCell_383 12))))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|)))) is different from false [2021-11-25 19:01:44,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_383 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_13263))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_383))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse1 (select (select .cse0 .cse1) (+ v_arrayElimCell_383 12))))) (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|))))) is different from false [2021-11-25 19:01:44,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_383 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_13263))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_383))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse1 (select (select .cse0 .cse1) (+ v_arrayElimCell_383 12))))) (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|))))) is different from false [2021-11-25 19:01:44,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_383 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 .cse4)) v_ArrVal_13263))) (or (not (= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (let ((.cse3 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse3 (select (select .cse1 .cse3) (+ v_arrayElimCell_383 12))))) (and (not (= v_arrayElimCell_383 .cse4)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|)))))) is different from false [2021-11-25 19:01:45,167 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 161 treesize of output 125 [2021-11-25 19:01:45,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_385 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse4 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_385 12))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse2) v_ArrVal_13263))) (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (not (= .cse3 .cse1)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|))))))) is different from false [2021-11-25 19:01:45,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_385 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse4 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_385 12))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse2) v_ArrVal_13263))) (let ((.cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse3 .cse0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|))))))) is different from false [2021-11-25 19:01:45,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_385 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse4 (+ |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|) .cse4)) (.cse3 (+ v_arrayElimCell_385 12))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse3) v_ArrVal_13263))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4))) (or (not (= .cse0 .cse1)) (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse2 .cse1) .cse3) .cse1)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|))))))) is different from false [2021-11-25 19:01:45,296 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 19:01:45,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250927434] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:01:45,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [721702916] [2021-11-25 19:01:45,297 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 19:01:45,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:01:45,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 50 [2021-11-25 19:01:45,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535823107] [2021-11-25 19:01:45,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:01:45,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-25 19:01:45,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:01:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-25 19:01:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1649, Unknown=9, NotChecked=810, Total=2652 [2021-11-25 19:01:45,300 INFO L87 Difference]: Start difference. First operand 4677 states and 11199 transitions. Second operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:45,490 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse10 (select .cse9 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (and (= (select .cse2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse3 (select .cse2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)) .cse3))))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_385 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse8 (+ |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|) .cse8)) (.cse7 (+ v_arrayElimCell_385 12))) (let ((.cse6 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse4) .cse7) v_ArrVal_13263))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse8))) (or (not (= .cse4 .cse5)) (not (= (select (select (store .cse6 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse6 .cse5) .cse7) .cse5)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|))))))) (not (= .cse0 0)) (< .cse0 |c_#StackHeapBarrier|) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse0) (= (select .cse1 4) 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse10) 12) 4) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse10))))) is different from false [2021-11-25 19:01:45,495 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|))) (let ((.cse0 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse5 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse12 4))) (and (not (= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) 12) 4) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (and (= (select .cse3 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse4 (select .cse3 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse3 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)) .cse4))))) (= (select .cse1 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|) (not (= .cse5 0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_#in~q_#1.offset|) (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_385 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse10 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse10)) (.cse8 (+ v_arrayElimCell_385 12))) (let ((.cse7 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse9) .cse8) v_ArrVal_13263))) (let ((.cse6 (select (select .cse7 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse10))) (or (not (= .cse6 (select (select .cse7 .cse6) .cse8))) (not (= (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse9 .cse6)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|))))))) (< .cse5 |c_#StackHeapBarrier|) (= (select .cse11 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse5) (not (= .cse2 |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0)))) is different from false [2021-11-25 19:01:45,499 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse5 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse6 (select .cse12 4))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_385 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse4 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4)) (.cse2 (+ v_arrayElimCell_385 12))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse2) v_ArrVal_13263))) (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (not (= .cse3 .cse1)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|))))))) (not (= .cse5 0)) (<= (select (select |c_#memory_$Pointer$.offset| .cse6) 12) 4) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse9))) (and (= (select .cse8 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse9 (select .cse8 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse8 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)) .cse9))))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= .cse10 0)) (= (select .cse7 4) 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (< .cse10 |c_#StackHeapBarrier|) (not (= .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|)) (= (select .cse11 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse10) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse6)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 19:01:45,504 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse8 (select .cse6 4)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_383 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 .cse4)) v_ArrVal_13263))) (or (not (= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (let ((.cse3 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse3 (select (select .cse1 .cse3) (+ v_arrayElimCell_383 12))))) (and (not (= v_arrayElimCell_383 .cse4)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|)))))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse5)) (not (= .cse5 0)) (= (select .cse6 .cse7) |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (not (= .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse10))) (and (= (select .cse9 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse10 (select .cse9 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse9 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)) .cse10))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select .cse11 4) 0) (not (= .cse12 0)) (= (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse8) 12) 4) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< .cse12 |c_#StackHeapBarrier|) (= (select .cse13 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse12) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| (select .cse11 .cse7))))) is different from false [2021-11-25 19:01:45,520 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse5 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse6 (select .cse12 4)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_383 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) (+ 12 .cse4)) v_ArrVal_13263))) (or (not (= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (let ((.cse3 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse3 (select (select .cse1 .cse3) (+ v_arrayElimCell_383 12))))) (and (not (= v_arrayElimCell_383 .cse4)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|)))))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse5)) (not (= .cse5 0)) (not (= .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse8))) (and (= (select .cse7 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse8 (select .cse7 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse7 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)) .cse8))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select .cse9 4) 0) (not (= .cse10 0)) (= (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse6) 12) 4) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< .cse10 |c_#StackHeapBarrier|) (= (select .cse11 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse10) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 19:01:45,547 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse1 (select .cse6 4)) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse0)) (not (= .cse0 0)) (not (= .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (and (= (select .cse2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse3 (select .cse2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)) .cse3))))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse5 0)) (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| .cse1) 12) 4) (= (select .cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (< .cse5 |c_#StackHeapBarrier|) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#q~1#1.offset| 4)) .cse5) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_383 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_13263))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_383))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|) (not (= (select (select (store .cse8 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (let ((.cse9 (select (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse9 (select (select .cse8 .cse9) (+ v_arrayElimCell_383 12))))) (not (= (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)))))))) is different from false [2021-11-25 19:01:45,718 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse9 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse2 (select .cse9 4)) (.cse3 (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (forall ((v_ArrVal_13266 (Array Int Int)) (v_arrayElimCell_383 Int) (v_ArrVal_13263 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_13263))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_383))) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= .cse1 (select (select .cse0 .cse1) (+ v_arrayElimCell_383 12))))) (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|))))) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (= .cse3 (select .cse4 (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (and (= .cse5 (select .cse6 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse6 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse5 (select .cse6 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12))))))) (not (= .cse7 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= (select .cse8 4) 0) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse7)) (not (= .cse3 0)) (= (select .cse8 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) 12) 4) (= (select .cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (< .cse3 |c_#StackHeapBarrier|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0)))) is different from false [2021-11-25 19:01:47,351 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_13266 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (not (= .cse0 0)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (exists ((v_arrayElimCell_377 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (= (select (select |c_#memory_$Pointer$.base| .cse1) (+ v_arrayElimCell_377 12)) .cse1))) (= .cse0 (select .cse2 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))))) is different from false [2021-11-25 19:01:47,446 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (and (< (+ |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (< (+ .cse0 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((v_ArrVal_13266 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203| v_ArrVal_13266) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_203|))) (exists ((v_arrayElimCell_377 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (= (select (select |c_#memory_$Pointer$.base| .cse1) (+ v_arrayElimCell_377 12)) .cse1))) (= .cse0 (select .cse2 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))))) is different from false [2021-11-25 19:01:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:01:51,673 INFO L93 Difference]: Finished difference Result 5448 states and 13087 transitions. [2021-11-25 19:01:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-25 19:01:51,674 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 19:01:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:01:51,680 INFO L225 Difference]: With dead ends: 5448 [2021-11-25 19:01:51,680 INFO L226 Difference]: Without dead ends: 5448 [2021-11-25 19:01:51,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=351, Invalid=3243, Unknown=18, NotChecked=2394, Total=6006 [2021-11-25 19:01:51,680 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 663 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 6622 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 15066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 6622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8417 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:01:51,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 126 Invalid, 15066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 6622 Invalid, 0 Unknown, 8417 Unchecked, 4.6s Time] [2021-11-25 19:01:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5448 states. [2021-11-25 19:01:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5448 to 4788. [2021-11-25 19:01:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4788 states, 4777 states have (on average 2.4115553694787524) internal successors, (11520), 4787 states have internal predecessors, (11520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 11520 transitions. [2021-11-25 19:01:51,740 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 11520 transitions. Word has length 23 [2021-11-25 19:01:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:01:51,741 INFO L470 AbstractCegarLoop]: Abstraction has 4788 states and 11520 transitions. [2021-11-25 19:01:51,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:01:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 11520 transitions. [2021-11-25 19:01:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:01:51,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:01:51,744 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 19:01:51,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 19:01:51,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:51,944 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2021-11-25 19:01:51,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:01:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1068977620, now seen corresponding path program 21 times [2021-11-25 19:01:51,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:01:51,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652886617] [2021-11-25 19:01:51,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:01:51,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:01:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:01:52,651 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 19:01:52,651 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:01:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652886617] [2021-11-25 19:01:52,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652886617] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:01:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218248936] [2021-11-25 19:01:52,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:01:52,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:01:52,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:01:52,653 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:01:52,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c49cb35-506a-45f8-b873-fb39ed88a1ac/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 19:01:53,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:01:53,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:01:53,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 138 conjunts are in the unsatisfiable core [2021-11-25 19:01:53,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:01:53,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:53,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:53,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:53,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:53,416 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 19:01:53,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:53,432 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 19:01:53,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:53,438 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 19:01:53,835 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 19:01:54,069 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-11-25 19:01:54,069 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 50 treesize of output 58 [2021-11-25 19:01:54,079 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 21 treesize of output 13 [2021-11-25 19:01:54,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:54,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:54,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:54,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2021-11-25 19:01:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:54,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:54,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:54,351 INFO L354 Elim1Store]: treesize reduction 92, result has 15.6 percent of original size [2021-11-25 19:01:54,351 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 6 case distinctions, treesize of input 76 treesize of output 52 [2021-11-25 19:01:54,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:01:54,515 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 81 treesize of output 69 [2021-11-25 19:01:54,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:01:54,889 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-25 19:01:54,889 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2021-11-25 19:01:54,900 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 13 treesize of output 9 [2021-11-25 19:01:54,950 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:01:54,950 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 19:01:54,952 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 19:01:54,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:01:54,964 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13467 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205| v_ArrVal_13467) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205|))) is different from false [2021-11-25 19:01:54,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13467 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205| Int)) (or (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205| v_ArrVal_13467) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2021-11-25 19:01:55,200 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:01:55,201 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 39 treesize of output 42 [2021-11-25 19:01:55,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13464 (Array Int Int)) (v_ArrVal_13467 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205| Int) (v_arrayElimCell_403 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_13464))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205| v_ArrVal_13467) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205|) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse1) (+ v_arrayElimCell_403 12)) .cse1))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| v_arrayElimCell_403)))))) is different from false [2021-11-25 19:01:55,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13464 (Array Int Int)) (v_ArrVal_13467 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205| Int) (v_arrayElimCell_403 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| 12)) v_ArrVal_13464))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base|)) (and (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| v_arrayElimCell_403)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (<= |c_#StackHeapBarrier| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205|) (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ 4 |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) (= (select (select .cse0 .cse1) (+ v_arrayElimCell_403 12)) .cse1))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_205| v_ArrVal_13467) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))) is different from false