./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:53:46,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:53:46,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:53:46,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:53:46,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:53:46,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:53:46,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:53:46,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:53:46,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:53:46,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:53:46,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:53:46,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:53:46,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:53:46,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:53:46,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:53:46,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:53:46,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:53:46,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:53:46,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:53:46,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:53:46,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:53:46,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:53:46,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:53:46,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:53:46,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:53:46,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:53:46,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:53:46,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:53:46,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:53:46,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:53:46,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:53:46,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:53:46,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:53:46,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:53:46,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:53:46,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:53:46,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:53:46,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:53:46,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:53:46,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:53:46,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:53:46,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:53:46,812 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:53:46,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:53:46,813 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:53:46,814 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:53:46,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:53:46,815 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:53:46,815 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:53:46,815 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:53:46,815 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:53:46,815 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:53:46,817 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:53:46,817 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:53:46,817 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:53:46,817 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:53:46,817 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:53:46,818 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:53:46,818 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:53:46,818 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:53:46,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:53:46,819 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:53:46,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:53:46,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:53:46,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:53:46,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:53:46,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:53:46,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:53:46,820 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:53:46,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:53:46,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:53:46,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:53:46,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:53:46,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:53:46,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:46,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:53:46,823 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:53:46,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:53:46,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:53:46,823 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:53:46,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:53:46,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:53:46,824 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:53:46,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/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_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32482febe38d61a93fd0705f3ad97c9c1ccc991b1238f75e4d1dd99bfb01c35e [2022-11-03 01:53:47,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:53:47,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:53:47,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:53:47,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:53:47,159 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:53:47,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2022-11-03 01:53:47,234 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/data/19d32be98/700ff276cd15464cb9ee530965d86416/FLAGd1d0addff [2022-11-03 01:53:47,922 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:53:47,923 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i [2022-11-03 01:53:47,939 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/data/19d32be98/700ff276cd15464cb9ee530965d86416/FLAGd1d0addff [2022-11-03 01:53:48,141 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/data/19d32be98/700ff276cd15464cb9ee530965d86416 [2022-11-03 01:53:48,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:53:48,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:53:48,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:48,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:53:48,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:53:48,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:48" (1/1) ... [2022-11-03 01:53:48,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7fc7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:48, skipping insertion in model container [2022-11-03 01:53:48,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:48" (1/1) ... [2022-11-03 01:53:48,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:53:48,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:53:48,405 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 01:53:48,788 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2022-11-03 01:53:48,796 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2022-11-03 01:53:48,818 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2022-11-03 01:53:48,820 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2022-11-03 01:53:48,836 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2022-11-03 01:53:48,836 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2022-11-03 01:53:48,855 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2022-11-03 01:53:48,857 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2022-11-03 01:53:48,859 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2022-11-03 01:53:48,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:48,868 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:53:48,888 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 01:53:48,920 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2022-11-03 01:53:48,922 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2022-11-03 01:53:48,933 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2022-11-03 01:53:48,935 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2022-11-03 01:53:48,946 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2022-11-03 01:53:48,947 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2022-11-03 01:53:48,950 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2022-11-03 01:53:48,951 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2022-11-03 01:53:48,951 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_82cbc629-96e9-4949-80b7-9631170f08bb/sv-benchmarks/c/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2022-11-03 01:53:48,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:49,008 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:53:49,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49 WrapperNode [2022-11-03 01:53:49,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:49,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:49,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:53:49,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:53:49,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,104 INFO L138 Inliner]: procedures = 278, calls = 103, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 416 [2022-11-03 01:53:49,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:49,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:53:49,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:53:49,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:53:49,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,149 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:53:49,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:53:49,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:53:49,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:53:49,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (1/1) ... [2022-11-03 01:53:49,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:49,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:49,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:53:49,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:53:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-11-03 01:53:49,263 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-11-03 01:53:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:53:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:53:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:53:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:53:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:53:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:53:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:53:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:53:49,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:53:49,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:53:49,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:53:49,268 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 01:53:49,478 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:53:49,479 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:53:50,206 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:53:50,219 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:53:50,219 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 01:53:50,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:50 BoogieIcfgContainer [2022-11-03 01:53:50,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:53:50,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:53:50,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:53:50,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:53:50,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:53:48" (1/3) ... [2022-11-03 01:53:50,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565c9173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:50, skipping insertion in model container [2022-11-03 01:53:50,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:49" (2/3) ... [2022-11-03 01:53:50,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565c9173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:50, skipping insertion in model container [2022-11-03 01:53:50,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:50" (3/3) ... [2022-11-03 01:53:50,230 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2022-11-03 01:53:50,238 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 01:53:50,249 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:53:50,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-03 01:53:50,249 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 01:53:50,352 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-03 01:53:50,394 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 01:53:50,408 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 478 places, 507 transitions, 1022 flow [2022-11-03 01:53:50,411 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 478 places, 507 transitions, 1022 flow [2022-11-03 01:53:50,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 478 places, 507 transitions, 1022 flow [2022-11-03 01:53:50,635 INFO L130 PetriNetUnfolder]: 33/506 cut-off events. [2022-11-03 01:53:50,635 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-03 01:53:50,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 506 events. 33/506 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1167 event pairs, 0 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 352. Up to 3 conditions per place. [2022-11-03 01:53:50,710 INFO L118 LiptonReduction]: Number of co-enabled transitions 36864 [2022-11-03 01:55:14,562 WARN L234 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 226 DAG size of output: 215 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 01:55:17,611 INFO L133 LiptonReduction]: Checked pairs total: 142572 [2022-11-03 01:55:17,612 INFO L135 LiptonReduction]: Total number of compositions: 535 [2022-11-03 01:55:17,621 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 124 transitions, 256 flow [2022-11-03 01:55:17,718 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1470 states, 1459 states have (on average 2.324880054832077) internal successors, (3392), 1469 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:17,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:55:17,740 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5813b205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:55:17,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-03 01:55:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 1470 states, 1459 states have (on average 2.324880054832077) internal successors, (3392), 1469 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-03 01:55:17,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:17,752 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-03 01:55:17,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:17,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1776, now seen corresponding path program 1 times [2022-11-03 01:55:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:17,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396257759] [2022-11-03 01:55:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:17,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:17,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396257759] [2022-11-03 01:55:17,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396257759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:17,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:17,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-03 01:55:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487518607] [2022-11-03 01:55:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:17,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 01:55:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:17,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 01:55:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 01:55:17,980 INFO L87 Difference]: Start difference. First operand has 1470 states, 1459 states have (on average 2.324880054832077) internal successors, (3392), 1469 states have internal predecessors, (3392), 0 states have call successors, (0), 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) [2022-11-03 01:55:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:18,266 INFO L93 Difference]: Finished difference Result 1469 states and 3296 transitions. [2022-11-03 01:55:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 01:55:18,270 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 [2022-11-03 01:55:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:18,297 INFO L225 Difference]: With dead ends: 1469 [2022-11-03 01:55:18,297 INFO L226 Difference]: Without dead ends: 1469 [2022-11-03 01:55:18,299 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:55:18,307 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:18,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:55:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-11-03 01:55:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2022-11-03 01:55:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1459 states have (on average 2.259081562714188) internal successors, (3296), 1468 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3296 transitions. [2022-11-03 01:55:18,435 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3296 transitions. Word has length 1 [2022-11-03 01:55:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:18,436 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 3296 transitions. [2022-11-03 01:55:18,436 INFO L496 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) [2022-11-03 01:55:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3296 transitions. [2022-11-03 01:55:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 01:55:18,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:18,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 01:55:18,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:55:18,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash 688526166, now seen corresponding path program 1 times [2022-11-03 01:55:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:18,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73540486] [2022-11-03 01:55:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:18,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:18,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73540486] [2022-11-03 01:55:18,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73540486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:18,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:18,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:55:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490010085] [2022-11-03 01:55:18,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:18,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:55:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:55:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:55:18,732 INFO L87 Difference]: Start difference. First operand 1469 states and 3296 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) [2022-11-03 01:55:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:19,137 INFO L93 Difference]: Finished difference Result 2761 states and 6206 transitions. [2022-11-03 01:55:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:55:19,141 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 [2022-11-03 01:55:19,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:19,157 INFO L225 Difference]: With dead ends: 2761 [2022-11-03 01:55:19,158 INFO L226 Difference]: Without dead ends: 2761 [2022-11-03 01:55:19,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:55:19,162 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 98 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:19,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 47 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:55:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2022-11-03 01:55:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 1488. [2022-11-03 01:55:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1478 states have (on average 2.257104194857916) internal successors, (3336), 1487 states have internal predecessors, (3336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3336 transitions. [2022-11-03 01:55:19,219 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3336 transitions. Word has length 6 [2022-11-03 01:55:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:19,219 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 3336 transitions. [2022-11-03 01:55:19,220 INFO L496 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) [2022-11-03 01:55:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3336 transitions. [2022-11-03 01:55:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:55:19,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:19,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:19,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:55:19,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:19,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:19,224 INFO L85 PathProgramCache]: Analyzing trace with hash -130902492, now seen corresponding path program 1 times [2022-11-03 01:55:19,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:19,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350549233] [2022-11-03 01:55:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:19,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:19,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350549233] [2022-11-03 01:55:19,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350549233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:19,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:19,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:55:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728476109] [2022-11-03 01:55:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:19,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:55:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:55:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:55:19,465 INFO L87 Difference]: Start difference. First operand 1488 states and 3336 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:19,707 INFO L93 Difference]: Finished difference Result 1488 states and 3317 transitions. [2022-11-03 01:55:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:55:19,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:55:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:19,714 INFO L225 Difference]: With dead ends: 1488 [2022-11-03 01:55:19,715 INFO L226 Difference]: Without dead ends: 1488 [2022-11-03 01:55:19,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:55:19,716 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 111 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:19,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 28 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:55:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-11-03 01:55:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2022-11-03 01:55:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1478 states have (on average 2.2442489851150205) internal successors, (3317), 1487 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3317 transitions. [2022-11-03 01:55:19,755 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3317 transitions. Word has length 7 [2022-11-03 01:55:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:19,755 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 3317 transitions. [2022-11-03 01:55:19,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3317 transitions. [2022-11-03 01:55:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:55:19,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:19,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:19,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:55:19,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash 244718363, now seen corresponding path program 1 times [2022-11-03 01:55:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:19,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828232216] [2022-11-03 01:55:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:20,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:20,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828232216] [2022-11-03 01:55:20,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828232216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:20,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:20,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:55:20,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806843777] [2022-11-03 01:55:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:20,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:55:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:55:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:55:20,354 INFO L87 Difference]: Start difference. First operand 1488 states and 3317 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) [2022-11-03 01:55:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:21,032 INFO L93 Difference]: Finished difference Result 1874 states and 4178 transitions. [2022-11-03 01:55:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:55:21,033 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 [2022-11-03 01:55:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:21,040 INFO L225 Difference]: With dead ends: 1874 [2022-11-03 01:55:21,040 INFO L226 Difference]: Without dead ends: 1874 [2022-11-03 01:55:21,041 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:55:21,042 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 151 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:21,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 25 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:55:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-11-03 01:55:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1595. [2022-11-03 01:55:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1585 states have (on average 2.2473186119873816) internal successors, (3562), 1594 states have internal predecessors, (3562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3562 transitions. [2022-11-03 01:55:21,126 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3562 transitions. Word has length 8 [2022-11-03 01:55:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:21,126 INFO L495 AbstractCegarLoop]: Abstraction has 1595 states and 3562 transitions. [2022-11-03 01:55:21,127 INFO L496 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) [2022-11-03 01:55:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3562 transitions. [2022-11-03 01:55:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:55:21,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:21,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:21,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:55:21,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1048382371, now seen corresponding path program 1 times [2022-11-03 01:55:21,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:21,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237883712] [2022-11-03 01:55:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:21,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:21,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237883712] [2022-11-03 01:55:21,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237883712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:21,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:21,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:55:21,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913158284] [2022-11-03 01:55:21,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:21,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:55:21,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:21,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:55:21,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:55:21,318 INFO L87 Difference]: Start difference. First operand 1595 states and 3562 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) [2022-11-03 01:55:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:21,642 INFO L93 Difference]: Finished difference Result 2641 states and 5888 transitions. [2022-11-03 01:55:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:55:21,643 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 [2022-11-03 01:55:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:21,655 INFO L225 Difference]: With dead ends: 2641 [2022-11-03 01:55:21,655 INFO L226 Difference]: Without dead ends: 2641 [2022-11-03 01:55:21,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:55:21,656 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 75 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:21,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 47 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:55:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2022-11-03 01:55:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1652. [2022-11-03 01:55:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1642 states have (on average 2.2423873325213153) internal successors, (3682), 1651 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3682 transitions. [2022-11-03 01:55:21,711 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3682 transitions. Word has length 10 [2022-11-03 01:55:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:21,711 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 3682 transitions. [2022-11-03 01:55:21,711 INFO L496 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) [2022-11-03 01:55:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3682 transitions. [2022-11-03 01:55:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:55:21,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:21,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:21,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:55:21,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:21,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1976547611, now seen corresponding path program 1 times [2022-11-03 01:55:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:21,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550347993] [2022-11-03 01:55:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:22,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:22,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550347993] [2022-11-03 01:55:22,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550347993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:22,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:22,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 01:55:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710794997] [2022-11-03 01:55:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:22,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:55:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:22,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:55:22,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:55:22,669 INFO L87 Difference]: Start difference. First operand 1652 states and 3682 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) [2022-11-03 01:55:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:24,442 INFO L93 Difference]: Finished difference Result 2046 states and 4542 transitions. [2022-11-03 01:55:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:55:24,442 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 [2022-11-03 01:55:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:24,452 INFO L225 Difference]: With dead ends: 2046 [2022-11-03 01:55:24,452 INFO L226 Difference]: Without dead ends: 2046 [2022-11-03 01:55:24,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2022-11-03 01:55:24,454 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 551 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:24,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 22 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-03 01:55:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-11-03 01:55:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1661. [2022-11-03 01:55:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1651 states have (on average 2.242277407631738) internal successors, (3702), 1660 states have internal predecessors, (3702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3702 transitions. [2022-11-03 01:55:24,503 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3702 transitions. Word has length 14 [2022-11-03 01:55:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:24,503 INFO L495 AbstractCegarLoop]: Abstraction has 1661 states and 3702 transitions. [2022-11-03 01:55:24,503 INFO L496 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) [2022-11-03 01:55:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3702 transitions. [2022-11-03 01:55:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:55:24,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:24,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:24,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:55:24,505 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:24,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash -172003963, now seen corresponding path program 2 times [2022-11-03 01:55:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:24,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838199617] [2022-11-03 01:55:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:25,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:25,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838199617] [2022-11-03 01:55:25,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838199617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:25,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:25,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 01:55:25,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535001647] [2022-11-03 01:55:25,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:25,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:55:25,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:25,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:55:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:55:25,607 INFO L87 Difference]: Start difference. First operand 1661 states and 3702 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) [2022-11-03 01:55:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:28,034 INFO L93 Difference]: Finished difference Result 2092 states and 4641 transitions. [2022-11-03 01:55:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 01:55:28,035 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 [2022-11-03 01:55:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:28,044 INFO L225 Difference]: With dead ends: 2092 [2022-11-03 01:55:28,045 INFO L226 Difference]: Without dead ends: 2092 [2022-11-03 01:55:28,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=589, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:55:28,046 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 474 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:28,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 34 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 01:55:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2022-11-03 01:55:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1668. [2022-11-03 01:55:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1658 states have (on average 2.2424607961399277) internal successors, (3718), 1667 states have internal predecessors, (3718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 3718 transitions. [2022-11-03 01:55:28,111 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 3718 transitions. Word has length 14 [2022-11-03 01:55:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:28,111 INFO L495 AbstractCegarLoop]: Abstraction has 1668 states and 3718 transitions. [2022-11-03 01:55:28,112 INFO L496 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) [2022-11-03 01:55:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 3718 transitions. [2022-11-03 01:55:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:55:28,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:28,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:28,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:55:28,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2142975387, now seen corresponding path program 3 times [2022-11-03 01:55:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:28,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850116751] [2022-11-03 01:55:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:29,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:29,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850116751] [2022-11-03 01:55:29,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850116751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:29,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:29,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 01:55:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375421551] [2022-11-03 01:55:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:29,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:55:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:29,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:55:29,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:55:29,362 INFO L87 Difference]: Start difference. First operand 1668 states and 3718 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) [2022-11-03 01:55:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:31,081 INFO L93 Difference]: Finished difference Result 2071 states and 4596 transitions. [2022-11-03 01:55:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:55:31,082 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 [2022-11-03 01:55:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:31,095 INFO L225 Difference]: With dead ends: 2071 [2022-11-03 01:55:31,095 INFO L226 Difference]: Without dead ends: 2071 [2022-11-03 01:55:31,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2022-11-03 01:55:31,097 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 332 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:31,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 31 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 01:55:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2022-11-03 01:55:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1661. [2022-11-03 01:55:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1651 states have (on average 2.242277407631738) internal successors, (3702), 1660 states have internal predecessors, (3702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3702 transitions. [2022-11-03 01:55:31,169 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3702 transitions. Word has length 14 [2022-11-03 01:55:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:31,170 INFO L495 AbstractCegarLoop]: Abstraction has 1661 states and 3702 transitions. [2022-11-03 01:55:31,170 INFO L496 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) [2022-11-03 01:55:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3702 transitions. [2022-11-03 01:55:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:55:31,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:31,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:31,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:55:31,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1644779197, now seen corresponding path program 1 times [2022-11-03 01:55:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:31,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715769744] [2022-11-03 01:55:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:31,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:31,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715769744] [2022-11-03 01:55:31,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715769744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:31,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:31,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:55:31,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244654832] [2022-11-03 01:55:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:31,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:55:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:31,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:55:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:55:31,565 INFO L87 Difference]: Start difference. First operand 1661 states and 3702 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:32,646 INFO L93 Difference]: Finished difference Result 2488 states and 5511 transitions. [2022-11-03 01:55:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:55:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 01:55:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:32,657 INFO L225 Difference]: With dead ends: 2488 [2022-11-03 01:55:32,658 INFO L226 Difference]: Without dead ends: 2402 [2022-11-03 01:55:32,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:55:32,659 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 118 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:32,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 30 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:55:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2022-11-03 01:55:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1819. [2022-11-03 01:55:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1809 states have (on average 2.267551133222775) internal successors, (4102), 1818 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 4102 transitions. [2022-11-03 01:55:32,727 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 4102 transitions. Word has length 14 [2022-11-03 01:55:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:32,728 INFO L495 AbstractCegarLoop]: Abstraction has 1819 states and 4102 transitions. [2022-11-03 01:55:32,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 4102 transitions. [2022-11-03 01:55:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:32,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:32,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:32,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:55:32,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:32,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash 176438754, now seen corresponding path program 1 times [2022-11-03 01:55:32,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:32,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377119249] [2022-11-03 01:55:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:32,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:33,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:33,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377119249] [2022-11-03 01:55:33,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377119249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:33,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:33,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 01:55:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556387426] [2022-11-03 01:55:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:33,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:55:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:33,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:55:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:55:33,435 INFO L87 Difference]: Start difference. First operand 1819 states and 4102 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) [2022-11-03 01:55:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:35,891 INFO L93 Difference]: Finished difference Result 2506 states and 5592 transitions. [2022-11-03 01:55:35,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 01:55:35,892 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 [2022-11-03 01:55:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:35,900 INFO L225 Difference]: With dead ends: 2506 [2022-11-03 01:55:35,901 INFO L226 Difference]: Without dead ends: 2506 [2022-11-03 01:55:35,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=418, Invalid=914, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 01:55:35,902 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 774 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:35,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 24 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 01:55:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2022-11-03 01:55:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1845. [2022-11-03 01:55:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1835 states have (on average 2.2670299727520438) internal successors, (4160), 1844 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 4160 transitions. [2022-11-03 01:55:35,964 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 4160 transitions. Word has length 15 [2022-11-03 01:55:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:35,964 INFO L495 AbstractCegarLoop]: Abstraction has 1845 states and 4160 transitions. [2022-11-03 01:55:35,965 INFO L496 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) [2022-11-03 01:55:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 4160 transitions. [2022-11-03 01:55:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:35,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:35,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:35,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:55:35,966 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash 689520780, now seen corresponding path program 2 times [2022-11-03 01:55:35,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:35,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728407893] [2022-11-03 01:55:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:36,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:36,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728407893] [2022-11-03 01:55:36,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728407893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:36,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:36,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 01:55:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394446909] [2022-11-03 01:55:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:36,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:55:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:55:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:55:36,901 INFO L87 Difference]: Start difference. First operand 1845 states and 4160 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) [2022-11-03 01:55:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:39,443 INFO L93 Difference]: Finished difference Result 2546 states and 5684 transitions. [2022-11-03 01:55:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 01:55:39,450 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 [2022-11-03 01:55:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:39,469 INFO L225 Difference]: With dead ends: 2546 [2022-11-03 01:55:39,469 INFO L226 Difference]: Without dead ends: 2546 [2022-11-03 01:55:39,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 01:55:39,471 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 796 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:39,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 28 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 01:55:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-11-03 01:55:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1858. [2022-11-03 01:55:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1848 states have (on average 2.2683982683982684) internal successors, (4192), 1857 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 4192 transitions. [2022-11-03 01:55:39,522 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 4192 transitions. Word has length 15 [2022-11-03 01:55:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:39,522 INFO L495 AbstractCegarLoop]: Abstraction has 1858 states and 4192 transitions. [2022-11-03 01:55:39,522 INFO L496 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) [2022-11-03 01:55:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 4192 transitions. [2022-11-03 01:55:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:39,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:39,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:39,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:55:39,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1491068574, now seen corresponding path program 3 times [2022-11-03 01:55:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:39,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652886569] [2022-11-03 01:55:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:39,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:40,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:40,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652886569] [2022-11-03 01:55:40,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652886569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:40,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:40,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 01:55:40,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792783647] [2022-11-03 01:55:40,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:40,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:55:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:55:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:55:40,418 INFO L87 Difference]: Start difference. First operand 1858 states and 4192 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) [2022-11-03 01:55:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:43,275 INFO L93 Difference]: Finished difference Result 2496 states and 5576 transitions. [2022-11-03 01:55:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 01:55:43,276 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 [2022-11-03 01:55:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:43,283 INFO L225 Difference]: With dead ends: 2496 [2022-11-03 01:55:43,283 INFO L226 Difference]: Without dead ends: 2496 [2022-11-03 01:55:43,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=404, Invalid=1078, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 01:55:43,285 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 666 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:43,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 32 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-03 01:55:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2022-11-03 01:55:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1869. [2022-11-03 01:55:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1859 states have (on average 2.268961807423346) internal successors, (4218), 1868 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) [2022-11-03 01:55:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 4218 transitions. [2022-11-03 01:55:43,334 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 4218 transitions. Word has length 15 [2022-11-03 01:55:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:43,335 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 4218 transitions. [2022-11-03 01:55:43,335 INFO L496 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) [2022-11-03 01:55:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 4218 transitions. [2022-11-03 01:55:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:43,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:43,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:55:43,337 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1553814540, now seen corresponding path program 4 times [2022-11-03 01:55:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:43,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589401269] [2022-11-03 01:55:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:44,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:44,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589401269] [2022-11-03 01:55:44,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589401269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:44,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:44,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 01:55:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290666402] [2022-11-03 01:55:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:44,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:55:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:44,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:55:44,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:55:44,126 INFO L87 Difference]: Start difference. First operand 1869 states and 4218 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) [2022-11-03 01:55:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:46,397 INFO L93 Difference]: Finished difference Result 2423 states and 5421 transitions. [2022-11-03 01:55:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 01:55:46,397 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 [2022-11-03 01:55:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:46,402 INFO L225 Difference]: With dead ends: 2423 [2022-11-03 01:55:46,402 INFO L226 Difference]: Without dead ends: 2423 [2022-11-03 01:55:46,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2022-11-03 01:55:46,403 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 578 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:46,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 33 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-03 01:55:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2022-11-03 01:55:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 1848. [2022-11-03 01:55:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1838 states have (on average 2.2682263329706203) internal successors, (4169), 1847 states have internal predecessors, (4169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 4169 transitions. [2022-11-03 01:55:46,452 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 4169 transitions. Word has length 15 [2022-11-03 01:55:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:46,452 INFO L495 AbstractCegarLoop]: Abstraction has 1848 states and 4169 transitions. [2022-11-03 01:55:46,452 INFO L496 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) [2022-11-03 01:55:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 4169 transitions. [2022-11-03 01:55:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:46,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:46,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:46,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 01:55:46,454 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:46,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1329037197, now seen corresponding path program 1 times [2022-11-03 01:55:46,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:46,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447619490] [2022-11-03 01:55:46,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:47,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:47,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447619490] [2022-11-03 01:55:47,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447619490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:47,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:47,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:55:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551477180] [2022-11-03 01:55:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:47,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:55:47,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:47,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:55:47,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:55:47,398 INFO L87 Difference]: Start difference. First operand 1848 states and 4169 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) [2022-11-03 01:55:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:48,550 INFO L93 Difference]: Finished difference Result 2407 states and 5404 transitions. [2022-11-03 01:55:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:55:48,551 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 [2022-11-03 01:55:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:48,557 INFO L225 Difference]: With dead ends: 2407 [2022-11-03 01:55:48,557 INFO L226 Difference]: Without dead ends: 2407 [2022-11-03 01:55:48,558 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:55:48,558 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 251 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:48,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 16 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:55:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2022-11-03 01:55:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 1913. [2022-11-03 01:55:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1903 states have (on average 2.2674724119810823) internal successors, (4315), 1912 states have internal predecessors, (4315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 4315 transitions. [2022-11-03 01:55:48,609 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 4315 transitions. Word has length 15 [2022-11-03 01:55:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:48,609 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 4315 transitions. [2022-11-03 01:55:48,610 INFO L496 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) [2022-11-03 01:55:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 4315 transitions. [2022-11-03 01:55:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:48,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:48,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:48,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 01:55:48,611 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:48,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash 397270297, now seen corresponding path program 2 times [2022-11-03 01:55:48,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:48,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104771221] [2022-11-03 01:55:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:50,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:50,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104771221] [2022-11-03 01:55:50,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104771221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:50,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:50,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:55:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475251898] [2022-11-03 01:55:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:50,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:55:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:55:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:55:50,536 INFO L87 Difference]: Start difference. First operand 1913 states and 4315 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) [2022-11-03 01:55:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:53,931 INFO L93 Difference]: Finished difference Result 2648 states and 5923 transitions. [2022-11-03 01:55:53,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 01:55:53,932 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 [2022-11-03 01:55:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:53,939 INFO L225 Difference]: With dead ends: 2648 [2022-11-03 01:55:53,939 INFO L226 Difference]: Without dead ends: 2648 [2022-11-03 01:55:53,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:55:53,940 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 423 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:53,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 32 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 01:55:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2022-11-03 01:55:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1937. [2022-11-03 01:55:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1927 states have (on average 2.268292682926829) internal successors, (4371), 1936 states have internal predecessors, (4371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 4371 transitions. [2022-11-03 01:55:53,992 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 4371 transitions. Word has length 15 [2022-11-03 01:55:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:53,992 INFO L495 AbstractCegarLoop]: Abstraction has 1937 states and 4371 transitions. [2022-11-03 01:55:53,993 INFO L496 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) [2022-11-03 01:55:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 4371 transitions. [2022-11-03 01:55:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:53,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:53,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:53,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 01:55:53,994 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:55:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1288452979, now seen corresponding path program 3 times [2022-11-03 01:55:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:53,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829915330] [2022-11-03 01:55:53,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:55,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:55,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829915330] [2022-11-03 01:55:55,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829915330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:55,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:55,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:55:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066345245] [2022-11-03 01:55:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:55,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:55:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:55,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:55:55,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:55:55,503 INFO L87 Difference]: Start difference. First operand 1937 states and 4371 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) [2022-11-03 01:56:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:01,444 INFO L93 Difference]: Finished difference Result 2901 states and 6478 transitions. [2022-11-03 01:56:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-03 01:56:01,444 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 [2022-11-03 01:56:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:01,450 INFO L225 Difference]: With dead ends: 2901 [2022-11-03 01:56:01,451 INFO L226 Difference]: Without dead ends: 2901 [2022-11-03 01:56:01,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=540, Invalid=1812, Unknown=0, NotChecked=0, Total=2352 [2022-11-03 01:56:01,452 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 786 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 3359 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:01,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 39 Invalid, 3452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3359 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-03 01:56:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2022-11-03 01:56:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1967. [2022-11-03 01:56:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1957 states have (on average 2.2682677567705674) internal successors, (4439), 1966 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 4439 transitions. [2022-11-03 01:56:01,503 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 4439 transitions. Word has length 15 [2022-11-03 01:56:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:01,503 INFO L495 AbstractCegarLoop]: Abstraction has 1967 states and 4439 transitions. [2022-11-03 01:56:01,503 INFO L496 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) [2022-11-03 01:56:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 4439 transitions. [2022-11-03 01:56:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:01,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:01,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:01,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 01:56:01,505 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash -31027339, now seen corresponding path program 4 times [2022-11-03 01:56:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:01,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988976531] [2022-11-03 01:56:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:02,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:02,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988976531] [2022-11-03 01:56:02,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988976531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:02,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:02,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:56:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672883475] [2022-11-03 01:56:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:02,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:56:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:56:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:56:02,700 INFO L87 Difference]: Start difference. First operand 1967 states and 4439 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) [2022-11-03 01:56:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:07,331 INFO L93 Difference]: Finished difference Result 2534 states and 5669 transitions. [2022-11-03 01:56:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 01:56:07,335 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 [2022-11-03 01:56:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:07,339 INFO L225 Difference]: With dead ends: 2534 [2022-11-03 01:56:07,339 INFO L226 Difference]: Without dead ends: 2534 [2022-11-03 01:56:07,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=452, Invalid=1108, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 01:56:07,340 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 464 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:07,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 39 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-03 01:56:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2022-11-03 01:56:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1976. [2022-11-03 01:56:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1966 states have (on average 2.268565615462869) internal successors, (4460), 1975 states have internal predecessors, (4460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4460 transitions. [2022-11-03 01:56:07,398 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4460 transitions. Word has length 15 [2022-11-03 01:56:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:07,400 INFO L495 AbstractCegarLoop]: Abstraction has 1976 states and 4460 transitions. [2022-11-03 01:56:07,400 INFO L496 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) [2022-11-03 01:56:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4460 transitions. [2022-11-03 01:56:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:07,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:07,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:07,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 01:56:07,402 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:07,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash -835194437, now seen corresponding path program 5 times [2022-11-03 01:56:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:07,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217054684] [2022-11-03 01:56:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:08,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:08,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217054684] [2022-11-03 01:56:08,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217054684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:08,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:08,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:56:08,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453459201] [2022-11-03 01:56:08,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:08,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:56:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:56:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:56:08,638 INFO L87 Difference]: Start difference. First operand 1976 states and 4460 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) [2022-11-03 01:56:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:12,840 INFO L93 Difference]: Finished difference Result 2478 states and 5553 transitions. [2022-11-03 01:56:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-03 01:56:12,841 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 [2022-11-03 01:56:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:12,844 INFO L225 Difference]: With dead ends: 2478 [2022-11-03 01:56:12,844 INFO L226 Difference]: Without dead ends: 2478 [2022-11-03 01:56:12,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=469, Invalid=1171, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 01:56:12,844 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 431 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:12,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 39 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-03 01:56:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2022-11-03 01:56:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 1967. [2022-11-03 01:56:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1957 states have (on average 2.2682677567705674) internal successors, (4439), 1966 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 4439 transitions. [2022-11-03 01:56:12,886 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 4439 transitions. Word has length 15 [2022-11-03 01:56:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:12,887 INFO L495 AbstractCegarLoop]: Abstraction has 1967 states and 4439 transitions. [2022-11-03 01:56:12,887 INFO L496 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) [2022-11-03 01:56:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 4439 transitions. [2022-11-03 01:56:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:12,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:12,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:12,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 01:56:12,889 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash -196775655, now seen corresponding path program 6 times [2022-11-03 01:56:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:12,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651142045] [2022-11-03 01:56:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:14,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:14,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651142045] [2022-11-03 01:56:14,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651142045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:14,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:14,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:56:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006551267] [2022-11-03 01:56:14,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:14,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:56:14,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:14,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:56:14,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:56:14,475 INFO L87 Difference]: Start difference. First operand 1967 states and 4439 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) [2022-11-03 01:56:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:20,884 INFO L93 Difference]: Finished difference Result 2773 states and 6197 transitions. [2022-11-03 01:56:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-03 01:56:20,885 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 [2022-11-03 01:56:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:20,888 INFO L225 Difference]: With dead ends: 2773 [2022-11-03 01:56:20,888 INFO L226 Difference]: Without dead ends: 2773 [2022-11-03 01:56:20,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=754, Invalid=2326, Unknown=0, NotChecked=0, Total=3080 [2022-11-03 01:56:20,889 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 703 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:20,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 34 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-03 01:56:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2022-11-03 01:56:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 1971. [2022-11-03 01:56:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1961 states have (on average 2.2677205507394187) internal successors, (4447), 1970 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) [2022-11-03 01:56:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 4447 transitions. [2022-11-03 01:56:20,942 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 4447 transitions. Word has length 15 [2022-11-03 01:56:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:20,942 INFO L495 AbstractCegarLoop]: Abstraction has 1971 states and 4447 transitions. [2022-11-03 01:56:20,942 INFO L496 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) [2022-11-03 01:56:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 4447 transitions. [2022-11-03 01:56:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:20,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:20,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:20,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 01:56:20,945 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:20,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash 785356493, now seen corresponding path program 7 times [2022-11-03 01:56:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:20,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274355898] [2022-11-03 01:56:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:20,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:21,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:21,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274355898] [2022-11-03 01:56:21,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274355898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:21,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:21,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:56:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055127549] [2022-11-03 01:56:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:21,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:56:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:56:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:21,596 INFO L87 Difference]: Start difference. First operand 1971 states and 4447 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) [2022-11-03 01:56:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:22,784 INFO L93 Difference]: Finished difference Result 2916 states and 6533 transitions. [2022-11-03 01:56:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:22,784 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 [2022-11-03 01:56:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:22,788 INFO L225 Difference]: With dead ends: 2916 [2022-11-03 01:56:22,788 INFO L226 Difference]: Without dead ends: 2916 [2022-11-03 01:56:22,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:56:22,790 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 289 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:22,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 18 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:56:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2022-11-03 01:56:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2067. [2022-11-03 01:56:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 2057 states have (on average 2.2717549829849295) internal successors, (4673), 2066 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 4673 transitions. [2022-11-03 01:56:22,839 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 4673 transitions. Word has length 15 [2022-11-03 01:56:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:22,839 INFO L495 AbstractCegarLoop]: Abstraction has 2067 states and 4673 transitions. [2022-11-03 01:56:22,840 INFO L496 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) [2022-11-03 01:56:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 4673 transitions. [2022-11-03 01:56:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:22,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:22,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:22,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 01:56:22,842 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -146410407, now seen corresponding path program 8 times [2022-11-03 01:56:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:22,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904945011] [2022-11-03 01:56:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:24,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:24,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904945011] [2022-11-03 01:56:24,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904945011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:24,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:24,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:56:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297947767] [2022-11-03 01:56:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:24,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:56:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:56:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:56:24,151 INFO L87 Difference]: Start difference. First operand 2067 states and 4673 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) [2022-11-03 01:56:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:28,066 INFO L93 Difference]: Finished difference Result 3060 states and 6838 transitions. [2022-11-03 01:56:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 01:56:28,066 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 [2022-11-03 01:56:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:28,071 INFO L225 Difference]: With dead ends: 3060 [2022-11-03 01:56:28,071 INFO L226 Difference]: Without dead ends: 3060 [2022-11-03 01:56:28,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=386, Invalid=874, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 01:56:28,072 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 551 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:28,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 37 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 01:56:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2022-11-03 01:56:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2071. [2022-11-03 01:56:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2061 states have (on average 2.272197962154294) internal successors, (4683), 2070 states have internal predecessors, (4683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 4683 transitions. [2022-11-03 01:56:28,129 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 4683 transitions. Word has length 15 [2022-11-03 01:56:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:28,130 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 4683 transitions. [2022-11-03 01:56:28,130 INFO L496 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) [2022-11-03 01:56:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 4683 transitions. [2022-11-03 01:56:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:28,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:28,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:28,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 01:56:28,133 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:28,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1832133683, now seen corresponding path program 9 times [2022-11-03 01:56:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:28,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657772669] [2022-11-03 01:56:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:29,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:29,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657772669] [2022-11-03 01:56:29,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657772669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:29,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:29,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:56:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274636825] [2022-11-03 01:56:29,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:29,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:56:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:29,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:56:29,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:56:29,545 INFO L87 Difference]: Start difference. First operand 2071 states and 4683 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) [2022-11-03 01:56:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:33,819 INFO L93 Difference]: Finished difference Result 3050 states and 6824 transitions. [2022-11-03 01:56:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 01:56:33,820 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 [2022-11-03 01:56:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:33,824 INFO L225 Difference]: With dead ends: 3050 [2022-11-03 01:56:33,824 INFO L226 Difference]: Without dead ends: 3050 [2022-11-03 01:56:33,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=409, Invalid=923, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 01:56:33,825 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 494 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:33,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 41 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2863 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-03 01:56:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2022-11-03 01:56:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 2053. [2022-11-03 01:56:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2043 states have (on average 2.2726382770435634) internal successors, (4643), 2052 states have internal predecessors, (4643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 4643 transitions. [2022-11-03 01:56:33,874 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 4643 transitions. Word has length 15 [2022-11-03 01:56:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:33,875 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 4643 transitions. [2022-11-03 01:56:33,875 INFO L496 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) [2022-11-03 01:56:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 4643 transitions. [2022-11-03 01:56:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:33,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:33,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:33,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 01:56:33,877 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:33,878 INFO L85 PathProgramCache]: Analyzing trace with hash -692430793, now seen corresponding path program 10 times [2022-11-03 01:56:33,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:33,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945800696] [2022-11-03 01:56:33,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:33,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:34,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:34,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945800696] [2022-11-03 01:56:34,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945800696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:34,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:34,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:56:34,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975808835] [2022-11-03 01:56:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:34,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:56:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:34,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:56:34,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:34,500 INFO L87 Difference]: Start difference. First operand 2053 states and 4643 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) [2022-11-03 01:56:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:35,649 INFO L93 Difference]: Finished difference Result 2722 states and 6087 transitions. [2022-11-03 01:56:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:35,649 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 [2022-11-03 01:56:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:35,653 INFO L225 Difference]: With dead ends: 2722 [2022-11-03 01:56:35,654 INFO L226 Difference]: Without dead ends: 2722 [2022-11-03 01:56:35,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:56:35,655 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 252 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:35,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 20 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:56:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2022-11-03 01:56:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2046. [2022-11-03 01:56:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2036 states have (on average 2.269646365422397) internal successors, (4621), 2045 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4621 transitions. [2022-11-03 01:56:35,715 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4621 transitions. Word has length 15 [2022-11-03 01:56:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:35,715 INFO L495 AbstractCegarLoop]: Abstraction has 2046 states and 4621 transitions. [2022-11-03 01:56:35,716 INFO L496 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) [2022-11-03 01:56:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4621 transitions. [2022-11-03 01:56:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:35,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:35,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:35,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 01:56:35,718 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1624197693, now seen corresponding path program 11 times [2022-11-03 01:56:35,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:35,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052847347] [2022-11-03 01:56:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:36,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:36,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052847347] [2022-11-03 01:56:36,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052847347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:36,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:36,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:56:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655829347] [2022-11-03 01:56:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:36,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:56:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:36,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:56:36,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:56:36,975 INFO L87 Difference]: Start difference. First operand 2046 states and 4621 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) [2022-11-03 01:56:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:40,006 INFO L93 Difference]: Finished difference Result 2822 states and 6280 transitions. [2022-11-03 01:56:40,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:56:40,007 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 [2022-11-03 01:56:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:40,010 INFO L225 Difference]: With dead ends: 2822 [2022-11-03 01:56:40,010 INFO L226 Difference]: Without dead ends: 2822 [2022-11-03 01:56:40,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:56:40,012 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 318 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:40,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 46 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-03 01:56:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2022-11-03 01:56:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 1963. [2022-11-03 01:56:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1953 states have (on average 2.2672811059907834) internal successors, (4428), 1962 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4428 transitions. [2022-11-03 01:56:40,049 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4428 transitions. Word has length 15 [2022-11-03 01:56:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:40,049 INFO L495 AbstractCegarLoop]: Abstraction has 1963 states and 4428 transitions. [2022-11-03 01:56:40,049 INFO L496 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) [2022-11-03 01:56:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4428 transitions. [2022-11-03 01:56:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:40,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:40,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:40,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 01:56:40,051 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash 985046327, now seen corresponding path program 12 times [2022-11-03 01:56:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:40,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374622203] [2022-11-03 01:56:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:40,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:40,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:40,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374622203] [2022-11-03 01:56:40,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374622203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:40,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:40,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:56:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50712635] [2022-11-03 01:56:40,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:40,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:56:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:56:40,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:56:40,947 INFO L87 Difference]: Start difference. First operand 1963 states and 4428 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) [2022-11-03 01:56:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:44,808 INFO L93 Difference]: Finished difference Result 2664 states and 5943 transitions. [2022-11-03 01:56:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:56:44,809 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 [2022-11-03 01:56:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:44,812 INFO L225 Difference]: With dead ends: 2664 [2022-11-03 01:56:44,812 INFO L226 Difference]: Without dead ends: 2664 [2022-11-03 01:56:44,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=731, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 01:56:44,814 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 395 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:44,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 49 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-03 01:56:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2022-11-03 01:56:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 1919. [2022-11-03 01:56:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1909 states have (on average 2.2619172341540073) internal successors, (4318), 1918 states have internal predecessors, (4318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 4318 transitions. [2022-11-03 01:56:44,871 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 4318 transitions. Word has length 15 [2022-11-03 01:56:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:44,872 INFO L495 AbstractCegarLoop]: Abstraction has 1919 states and 4318 transitions. [2022-11-03 01:56:44,872 INFO L496 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) [2022-11-03 01:56:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 4318 transitions. [2022-11-03 01:56:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:56:44,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:44,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:44,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 01:56:44,876 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash -729469831, now seen corresponding path program 1 times [2022-11-03 01:56:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:44,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156089159] [2022-11-03 01:56:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:47,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:47,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156089159] [2022-11-03 01:56:47,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156089159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:47,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:47,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 01:56:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556702636] [2022-11-03 01:56:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:47,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:56:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:56:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:56:47,008 INFO L87 Difference]: Start difference. First operand 1919 states and 4318 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) [2022-11-03 01:56:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:55,381 INFO L93 Difference]: Finished difference Result 3573 states and 8018 transitions. [2022-11-03 01:56:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-03 01:56:55,383 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 [2022-11-03 01:56:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:55,388 INFO L225 Difference]: With dead ends: 3573 [2022-11-03 01:56:55,388 INFO L226 Difference]: Without dead ends: 3573 [2022-11-03 01:56:55,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=630, Invalid=1920, Unknown=0, NotChecked=0, Total=2550 [2022-11-03 01:56:55,390 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 573 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 4576 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 4667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 4576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:55,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 54 Invalid, 4667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 4576 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-03 01:56:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2022-11-03 01:56:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 2060. [2022-11-03 01:56:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2050 states have (on average 2.279512195121951) internal successors, (4673), 2059 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 4673 transitions. [2022-11-03 01:56:55,438 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 4673 transitions. Word has length 17 [2022-11-03 01:56:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:55,439 INFO L495 AbstractCegarLoop]: Abstraction has 2060 states and 4673 transitions. [2022-11-03 01:56:55,439 INFO L496 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) [2022-11-03 01:56:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 4673 transitions. [2022-11-03 01:56:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:56:55,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:55,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:55,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-03 01:56:55,441 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:56:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash -95372243, now seen corresponding path program 2 times [2022-11-03 01:56:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:55,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495114052] [2022-11-03 01:56:55,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:56,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:56,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495114052] [2022-11-03 01:56:56,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495114052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:56,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:56,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:56:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304692159] [2022-11-03 01:56:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:56,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:56:56,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:56:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:56:56,489 INFO L87 Difference]: Start difference. First operand 2060 states and 4673 transitions. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:00,433 INFO L93 Difference]: Finished difference Result 3261 states and 7364 transitions. [2022-11-03 01:57:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 01:57:00,434 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 01:57:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:00,437 INFO L225 Difference]: With dead ends: 3261 [2022-11-03 01:57:00,437 INFO L226 Difference]: Without dead ends: 3261 [2022-11-03 01:57:00,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=337, Invalid=853, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 01:57:00,438 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 689 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:00,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 45 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 01:57:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-11-03 01:57:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 2071. [2022-11-03 01:57:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2061 states have (on average 2.2785055798156235) internal successors, (4696), 2070 states have internal predecessors, (4696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 4696 transitions. [2022-11-03 01:57:00,483 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 4696 transitions. Word has length 17 [2022-11-03 01:57:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:00,483 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 4696 transitions. [2022-11-03 01:57:00,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 4696 transitions. [2022-11-03 01:57:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:00,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:00,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:00,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 01:57:00,486 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1404857621, now seen corresponding path program 3 times [2022-11-03 01:57:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:00,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193766301] [2022-11-03 01:57:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:01,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:01,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193766301] [2022-11-03 01:57:01,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193766301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:01,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:01,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:57:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099138220] [2022-11-03 01:57:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:01,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:57:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:57:01,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:57:01,687 INFO L87 Difference]: Start difference. First operand 2071 states and 4696 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) [2022-11-03 01:57:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:06,657 INFO L93 Difference]: Finished difference Result 3104 states and 7009 transitions. [2022-11-03 01:57:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-03 01:57:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 01:57:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:06,661 INFO L225 Difference]: With dead ends: 3104 [2022-11-03 01:57:06,661 INFO L226 Difference]: Without dead ends: 3104 [2022-11-03 01:57:06,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=482, Invalid=1324, Unknown=0, NotChecked=0, Total=1806 [2022-11-03 01:57:06,662 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 592 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 2981 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:06,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 47 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2981 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-03 01:57:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2022-11-03 01:57:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 2071. [2022-11-03 01:57:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2061 states have (on average 2.2785055798156235) internal successors, (4696), 2070 states have internal predecessors, (4696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 4696 transitions. [2022-11-03 01:57:06,704 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 4696 transitions. Word has length 17 [2022-11-03 01:57:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:06,705 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 4696 transitions. [2022-11-03 01:57:06,705 INFO L496 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) [2022-11-03 01:57:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 4696 transitions. [2022-11-03 01:57:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:06,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:06,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:06,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 01:57:06,707 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:06,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:06,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1694389723, now seen corresponding path program 4 times [2022-11-03 01:57:06,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:06,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63381263] [2022-11-03 01:57:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:07,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:07,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63381263] [2022-11-03 01:57:07,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63381263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:07,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:07,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:57:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229050907] [2022-11-03 01:57:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:07,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:57:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:57:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:57:07,693 INFO L87 Difference]: Start difference. First operand 2071 states and 4696 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) [2022-11-03 01:57:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:14,184 INFO L93 Difference]: Finished difference Result 3104 states and 7009 transitions. [2022-11-03 01:57:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-03 01:57:14,185 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 [2022-11-03 01:57:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:14,188 INFO L225 Difference]: With dead ends: 3104 [2022-11-03 01:57:14,189 INFO L226 Difference]: Without dead ends: 3104 [2022-11-03 01:57:14,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=668, Invalid=1782, Unknown=0, NotChecked=0, Total=2450 [2022-11-03 01:57:14,190 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 597 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:14,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 49 Invalid, 4091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-03 01:57:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2022-11-03 01:57:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 2071. [2022-11-03 01:57:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2061 states have (on average 2.2785055798156235) internal successors, (4696), 2070 states have internal predecessors, (4696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 4696 transitions. [2022-11-03 01:57:14,232 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 4696 transitions. Word has length 17 [2022-11-03 01:57:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:14,232 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 4696 transitions. [2022-11-03 01:57:14,232 INFO L496 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) [2022-11-03 01:57:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 4696 transitions. [2022-11-03 01:57:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:14,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:14,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:14,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 01:57:14,234 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 284922681, now seen corresponding path program 5 times [2022-11-03 01:57:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:14,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600943047] [2022-11-03 01:57:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:15,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600943047] [2022-11-03 01:57:15,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600943047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:15,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:15,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:57:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820502256] [2022-11-03 01:57:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:57:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:57:15,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:57:15,400 INFO L87 Difference]: Start difference. First operand 2071 states and 4696 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) [2022-11-03 01:57:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:20,708 INFO L93 Difference]: Finished difference Result 3577 states and 8122 transitions. [2022-11-03 01:57:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 01:57:20,708 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 [2022-11-03 01:57:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:20,712 INFO L225 Difference]: With dead ends: 3577 [2022-11-03 01:57:20,712 INFO L226 Difference]: Without dead ends: 3577 [2022-11-03 01:57:20,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=395, Invalid=1087, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 01:57:20,713 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 666 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 2798 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:20,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 43 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2798 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-03 01:57:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2022-11-03 01:57:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 2079. [2022-11-03 01:57:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2069 states have (on average 2.2774287095215078) internal successors, (4712), 2078 states have internal predecessors, (4712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 4712 transitions. [2022-11-03 01:57:20,757 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 4712 transitions. Word has length 17 [2022-11-03 01:57:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:20,758 INFO L495 AbstractCegarLoop]: Abstraction has 2079 states and 4712 transitions. [2022-11-03 01:57:20,758 INFO L496 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) [2022-11-03 01:57:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 4712 transitions. [2022-11-03 01:57:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:20,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:20,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:20,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 01:57:20,760 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash -657663385, now seen corresponding path program 6 times [2022-11-03 01:57:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:20,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937891825] [2022-11-03 01:57:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:21,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:21,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937891825] [2022-11-03 01:57:21,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937891825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:21,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:21,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:57:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790708977] [2022-11-03 01:57:21,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:21,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:57:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:57:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:57:21,788 INFO L87 Difference]: Start difference. First operand 2079 states and 4712 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) [2022-11-03 01:57:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:27,627 INFO L93 Difference]: Finished difference Result 3505 states and 7957 transitions. [2022-11-03 01:57:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-03 01:57:27,628 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 [2022-11-03 01:57:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:27,632 INFO L225 Difference]: With dead ends: 3505 [2022-11-03 01:57:27,633 INFO L226 Difference]: Without dead ends: 3505 [2022-11-03 01:57:27,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=606, Invalid=1746, Unknown=0, NotChecked=0, Total=2352 [2022-11-03 01:57:27,634 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 542 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 4037 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:27,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 51 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4037 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-03 01:57:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2022-11-03 01:57:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 2079. [2022-11-03 01:57:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2069 states have (on average 2.2774287095215078) internal successors, (4712), 2078 states have internal predecessors, (4712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 4712 transitions. [2022-11-03 01:57:27,663 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 4712 transitions. Word has length 17 [2022-11-03 01:57:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:27,663 INFO L495 AbstractCegarLoop]: Abstraction has 2079 states and 4712 transitions. [2022-11-03 01:57:27,663 INFO L496 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) [2022-11-03 01:57:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 4712 transitions. [2022-11-03 01:57:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:27,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:27,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:27,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 01:57:27,665 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 779383737, now seen corresponding path program 7 times [2022-11-03 01:57:27,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:27,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903094540] [2022-11-03 01:57:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:30,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:30,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903094540] [2022-11-03 01:57:30,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903094540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:30,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:30,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 01:57:30,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231240363] [2022-11-03 01:57:30,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:30,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:57:30,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:57:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:57:30,381 INFO L87 Difference]: Start difference. First operand 2079 states and 4712 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) [2022-11-03 01:57:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:35,784 INFO L93 Difference]: Finished difference Result 4099 states and 9259 transitions. [2022-11-03 01:57:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 01:57:35,785 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 [2022-11-03 01:57:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:35,793 INFO L225 Difference]: With dead ends: 4099 [2022-11-03 01:57:35,793 INFO L226 Difference]: Without dead ends: 4099 [2022-11-03 01:57:35,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=505, Invalid=1301, Unknown=0, NotChecked=0, Total=1806 [2022-11-03 01:57:35,794 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 750 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:35,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 40 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-03 01:57:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2022-11-03 01:57:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 2129. [2022-11-03 01:57:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 2119 states have (on average 2.2873997168475695) internal successors, (4847), 2128 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 4847 transitions. [2022-11-03 01:57:35,830 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 4847 transitions. Word has length 17 [2022-11-03 01:57:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:35,830 INFO L495 AbstractCegarLoop]: Abstraction has 2129 states and 4847 transitions. [2022-11-03 01:57:35,830 INFO L496 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) [2022-11-03 01:57:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 4847 transitions. [2022-11-03 01:57:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:35,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:35,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:35,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 01:57:35,833 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash 784601967, now seen corresponding path program 8 times [2022-11-03 01:57:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:35,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066268045] [2022-11-03 01:57:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:37,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:37,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066268045] [2022-11-03 01:57:37,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066268045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:37,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:37,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 01:57:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589704962] [2022-11-03 01:57:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:37,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:57:37,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:37,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:57:37,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:57:37,517 INFO L87 Difference]: Start difference. First operand 2129 states and 4847 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) [2022-11-03 01:57:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:42,710 INFO L93 Difference]: Finished difference Result 3642 states and 8210 transitions. [2022-11-03 01:57:42,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 01:57:42,710 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 [2022-11-03 01:57:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:42,715 INFO L225 Difference]: With dead ends: 3642 [2022-11-03 01:57:42,715 INFO L226 Difference]: Without dead ends: 3642 [2022-11-03 01:57:42,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 01:57:42,716 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 647 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 3468 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:42,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 51 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3468 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-03 01:57:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2022-11-03 01:57:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 2136. [2022-11-03 01:57:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2126 states have (on average 2.2878645343367827) internal successors, (4864), 2135 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4864 transitions. [2022-11-03 01:57:42,748 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4864 transitions. Word has length 17 [2022-11-03 01:57:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:42,748 INFO L495 AbstractCegarLoop]: Abstraction has 2136 states and 4864 transitions. [2022-11-03 01:57:42,749 INFO L496 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) [2022-11-03 01:57:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4864 transitions. [2022-11-03 01:57:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:42,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:42,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:42,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 01:57:42,751 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1413481325, now seen corresponding path program 9 times [2022-11-03 01:57:42,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:42,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309519495] [2022-11-03 01:57:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:43,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:43,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309519495] [2022-11-03 01:57:43,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309519495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:43,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:43,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:57:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755209813] [2022-11-03 01:57:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:43,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:57:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:43,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:57:43,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:57:43,881 INFO L87 Difference]: Start difference. First operand 2136 states and 4864 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) [2022-11-03 01:57:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:48,566 INFO L93 Difference]: Finished difference Result 3726 states and 8448 transitions. [2022-11-03 01:57:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 01:57:48,567 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 [2022-11-03 01:57:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:48,571 INFO L225 Difference]: With dead ends: 3726 [2022-11-03 01:57:48,572 INFO L226 Difference]: Without dead ends: 3726 [2022-11-03 01:57:48,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=439, Invalid=1121, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 01:57:48,572 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 659 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 3141 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:48,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 45 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3141 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-03 01:57:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2022-11-03 01:57:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 2086. [2022-11-03 01:57:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2076 states have (on average 2.2803468208092488) internal successors, (4734), 2085 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 4734 transitions. [2022-11-03 01:57:48,605 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 4734 transitions. Word has length 17 [2022-11-03 01:57:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:48,606 INFO L495 AbstractCegarLoop]: Abstraction has 2086 states and 4734 transitions. [2022-11-03 01:57:48,606 INFO L496 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) [2022-11-03 01:57:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 4734 transitions. [2022-11-03 01:57:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:48,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:48,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:48,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-03 01:57:48,608 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2034990429, now seen corresponding path program 10 times [2022-11-03 01:57:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:48,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634514577] [2022-11-03 01:57:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:50,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:50,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634514577] [2022-11-03 01:57:50,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634514577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:50,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:50,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 01:57:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427310110] [2022-11-03 01:57:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:50,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:57:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:57:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:57:50,343 INFO L87 Difference]: Start difference. First operand 2086 states and 4734 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) [2022-11-03 01:57:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:55,458 INFO L93 Difference]: Finished difference Result 3560 states and 8014 transitions. [2022-11-03 01:57:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 01:57:55,459 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 [2022-11-03 01:57:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:55,465 INFO L225 Difference]: With dead ends: 3560 [2022-11-03 01:57:55,465 INFO L226 Difference]: Without dead ends: 3560 [2022-11-03 01:57:55,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 01:57:55,466 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 536 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 2994 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:55,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 44 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2994 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-03 01:57:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2022-11-03 01:57:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2105. [2022-11-03 01:57:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2095 states have (on average 2.2859188544152746) internal successors, (4789), 2104 states have internal predecessors, (4789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 4789 transitions. [2022-11-03 01:57:55,509 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 4789 transitions. Word has length 17 [2022-11-03 01:57:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:55,509 INFO L495 AbstractCegarLoop]: Abstraction has 2105 states and 4789 transitions. [2022-11-03 01:57:55,509 INFO L496 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) [2022-11-03 01:57:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 4789 transitions. [2022-11-03 01:57:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:55,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:55,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:55,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-03 01:57:55,511 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:57:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2029772199, now seen corresponding path program 11 times [2022-11-03 01:57:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:55,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689836644] [2022-11-03 01:57:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:56,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:56,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689836644] [2022-11-03 01:57:56,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689836644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:56,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:56,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:57:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586148200] [2022-11-03 01:57:56,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:56,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:57:56,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:56,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:57:56,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:57:56,707 INFO L87 Difference]: Start difference. First operand 2105 states and 4789 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) [2022-11-03 01:58:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:00,605 INFO L93 Difference]: Finished difference Result 3571 states and 8090 transitions. [2022-11-03 01:58:00,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 01:58:00,606 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 [2022-11-03 01:58:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:00,610 INFO L225 Difference]: With dead ends: 3571 [2022-11-03 01:58:00,611 INFO L226 Difference]: Without dead ends: 3571 [2022-11-03 01:58:00,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=214, Invalid=598, Unknown=0, NotChecked=0, Total=812 [2022-11-03 01:58:00,611 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 427 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 3265 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:00,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 51 Invalid, 3302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3265 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-03 01:58:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-11-03 01:58:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2111. [2022-11-03 01:58:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 2101 states have (on average 2.287958115183246) internal successors, (4807), 2110 states have internal predecessors, (4807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 4807 transitions. [2022-11-03 01:58:00,648 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 4807 transitions. Word has length 17 [2022-11-03 01:58:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:00,648 INFO L495 AbstractCegarLoop]: Abstraction has 2111 states and 4807 transitions. [2022-11-03 01:58:00,648 INFO L496 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) [2022-11-03 01:58:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 4807 transitions. [2022-11-03 01:58:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:58:00,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:00,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:00,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-03 01:58:00,650 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1400892841, now seen corresponding path program 12 times [2022-11-03 01:58:00,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:00,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170475049] [2022-11-03 01:58:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:00,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:01,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:01,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170475049] [2022-11-03 01:58:01,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170475049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:01,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:01,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:58:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478735506] [2022-11-03 01:58:01,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:01,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:58:01,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:01,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:58:01,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:58:01,673 INFO L87 Difference]: Start difference. First operand 2111 states and 4807 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) [2022-11-03 01:58:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:05,791 INFO L93 Difference]: Finished difference Result 3455 states and 7845 transitions. [2022-11-03 01:58:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 01:58:05,791 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 [2022-11-03 01:58:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:05,796 INFO L225 Difference]: With dead ends: 3455 [2022-11-03 01:58:05,796 INFO L226 Difference]: Without dead ends: 3455 [2022-11-03 01:58:05,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=355, Invalid=905, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 01:58:05,797 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 561 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:05,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 43 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 01:58:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2022-11-03 01:58:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 2022. [2022-11-03 01:58:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 2012 states have (on average 2.275347912524851) internal successors, (4578), 2021 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 4578 transitions. [2022-11-03 01:58:05,828 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 4578 transitions. Word has length 17 [2022-11-03 01:58:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:05,829 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 4578 transitions. [2022-11-03 01:58:05,829 INFO L496 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) [2022-11-03 01:58:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 4578 transitions. [2022-11-03 01:58:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:58:05,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:05,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:05,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-03 01:58:05,830 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:05,830 INFO L85 PathProgramCache]: Analyzing trace with hash -882795876, now seen corresponding path program 1 times [2022-11-03 01:58:05,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:05,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374708883] [2022-11-03 01:58:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:05,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:06,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:06,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374708883] [2022-11-03 01:58:06,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374708883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:06,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:06,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 01:58:06,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407824889] [2022-11-03 01:58:06,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:06,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:58:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:06,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:58:06,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:58:06,777 INFO L87 Difference]: Start difference. First operand 2022 states and 4578 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) [2022-11-03 01:58:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:09,494 INFO L93 Difference]: Finished difference Result 2556 states and 5720 transitions. [2022-11-03 01:58:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:58:09,495 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 [2022-11-03 01:58:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:09,498 INFO L225 Difference]: With dead ends: 2556 [2022-11-03 01:58:09,498 INFO L226 Difference]: Without dead ends: 2556 [2022-11-03 01:58:09,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=255, Invalid=501, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:58:09,499 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 564 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:09,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 25 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 01:58:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-11-03 01:58:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2058. [2022-11-03 01:58:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2048 states have (on average 2.2724609375) internal successors, (4654), 2057 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 4654 transitions. [2022-11-03 01:58:09,527 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 4654 transitions. Word has length 18 [2022-11-03 01:58:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:09,528 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 4654 transitions. [2022-11-03 01:58:09,528 INFO L496 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) [2022-11-03 01:58:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 4654 transitions. [2022-11-03 01:58:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:58:09,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:09,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:09,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-03 01:58:09,530 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1536527712, now seen corresponding path program 2 times [2022-11-03 01:58:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:09,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724751911] [2022-11-03 01:58:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:10,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:10,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724751911] [2022-11-03 01:58:10,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724751911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:10,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:10,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 01:58:10,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74918371] [2022-11-03 01:58:10,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:10,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:58:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:58:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:58:10,330 INFO L87 Difference]: Start difference. First operand 2058 states and 4654 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) [2022-11-03 01:58:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:12,394 INFO L93 Difference]: Finished difference Result 2586 states and 5783 transitions. [2022-11-03 01:58:12,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:58:12,394 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 [2022-11-03 01:58:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:12,398 INFO L225 Difference]: With dead ends: 2586 [2022-11-03 01:58:12,398 INFO L226 Difference]: Without dead ends: 2586 [2022-11-03 01:58:12,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-11-03 01:58:12,398 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 507 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:12,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 25 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 01:58:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-11-03 01:58:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2058. [2022-11-03 01:58:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2048 states have (on average 2.2724609375) internal successors, (4654), 2057 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 4654 transitions. [2022-11-03 01:58:12,427 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 4654 transitions. Word has length 18 [2022-11-03 01:58:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:12,427 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 4654 transitions. [2022-11-03 01:58:12,427 INFO L496 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) [2022-11-03 01:58:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 4654 transitions. [2022-11-03 01:58:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:58:12,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:12,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:12,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-03 01:58:12,429 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:12,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1526523702, now seen corresponding path program 3 times [2022-11-03 01:58:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:12,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653470949] [2022-11-03 01:58:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:13,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:13,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653470949] [2022-11-03 01:58:13,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653470949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:13,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:13,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:58:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159253300] [2022-11-03 01:58:13,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:13,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:58:13,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:13,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:58:13,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:58:13,479 INFO L87 Difference]: Start difference. First operand 2058 states and 4654 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:16,389 INFO L93 Difference]: Finished difference Result 2596 states and 5800 transitions. [2022-11-03 01:58:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:58:16,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 01:58:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:16,393 INFO L225 Difference]: With dead ends: 2596 [2022-11-03 01:58:16,393 INFO L226 Difference]: Without dead ends: 2596 [2022-11-03 01:58:16,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2022-11-03 01:58:16,394 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 613 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:16,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 25 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-03 01:58:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2022-11-03 01:58:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2066. [2022-11-03 01:58:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2056 states have (on average 2.2714007782101167) internal successors, (4670), 2065 states have internal predecessors, (4670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 4670 transitions. [2022-11-03 01:58:16,430 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 4670 transitions. Word has length 18 [2022-11-03 01:58:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:16,430 INFO L495 AbstractCegarLoop]: Abstraction has 2066 states and 4670 transitions. [2022-11-03 01:58:16,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 4670 transitions. [2022-11-03 01:58:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:58:16,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:16,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:16,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-03 01:58:16,432 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:16,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2138049578, now seen corresponding path program 4 times [2022-11-03 01:58:16,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:16,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754324827] [2022-11-03 01:58:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:16,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:17,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:17,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754324827] [2022-11-03 01:58:17,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754324827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:17,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:17,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:58:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429690217] [2022-11-03 01:58:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:17,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:58:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:17,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:58:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:58:17,270 INFO L87 Difference]: Start difference. First operand 2066 states and 4670 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:21,182 INFO L93 Difference]: Finished difference Result 2778 states and 6189 transitions. [2022-11-03 01:58:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-03 01:58:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 01:58:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:21,186 INFO L225 Difference]: With dead ends: 2778 [2022-11-03 01:58:21,187 INFO L226 Difference]: Without dead ends: 2778 [2022-11-03 01:58:21,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=578, Invalid=1492, Unknown=0, NotChecked=0, Total=2070 [2022-11-03 01:58:21,188 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 879 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:21,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 28 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 01:58:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2022-11-03 01:58:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2102. [2022-11-03 01:58:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2102 states, 2092 states have (on average 2.27151051625239) internal successors, (4752), 2101 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 4752 transitions. [2022-11-03 01:58:21,225 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 4752 transitions. Word has length 18 [2022-11-03 01:58:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:21,225 INFO L495 AbstractCegarLoop]: Abstraction has 2102 states and 4752 transitions. [2022-11-03 01:58:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 4752 transitions. [2022-11-03 01:58:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:58:21,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:21,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:21,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-03 01:58:21,227 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash -992600850, now seen corresponding path program 5 times [2022-11-03 01:58:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:21,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080686176] [2022-11-03 01:58:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:21,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:21,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080686176] [2022-11-03 01:58:21,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080686176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:21,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:21,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:58:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824200603] [2022-11-03 01:58:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:21,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:58:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:21,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:58:21,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:58:21,876 INFO L87 Difference]: Start difference. First operand 2102 states and 4752 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:26,296 INFO L93 Difference]: Finished difference Result 2890 states and 6437 transitions. [2022-11-03 01:58:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-03 01:58:26,300 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 01:58:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:26,303 INFO L225 Difference]: With dead ends: 2890 [2022-11-03 01:58:26,303 INFO L226 Difference]: Without dead ends: 2890 [2022-11-03 01:58:26,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=592, Invalid=1664, Unknown=0, NotChecked=0, Total=2256 [2022-11-03 01:58:26,304 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 861 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 4108 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:26,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 38 Invalid, 4154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4108 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-03 01:58:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2022-11-03 01:58:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2106. [2022-11-03 01:58:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2096 states have (on average 2.2709923664122136) internal successors, (4760), 2105 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 4760 transitions. [2022-11-03 01:58:26,343 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 4760 transitions. Word has length 18 [2022-11-03 01:58:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:26,343 INFO L495 AbstractCegarLoop]: Abstraction has 2106 states and 4760 transitions. [2022-11-03 01:58:26,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 4760 transitions. [2022-11-03 01:58:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:58:26,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:26,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:26,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-03 01:58:26,344 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash -140267426, now seen corresponding path program 6 times [2022-11-03 01:58:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:26,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167701932] [2022-11-03 01:58:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:27,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:27,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167701932] [2022-11-03 01:58:27,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167701932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:27,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:27,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:58:27,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296160481] [2022-11-03 01:58:27,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:27,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:58:27,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:58:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:58:27,122 INFO L87 Difference]: Start difference. First operand 2106 states and 4760 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) [2022-11-03 01:58:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:28,186 INFO L93 Difference]: Finished difference Result 2166 states and 4857 transitions. [2022-11-03 01:58:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:58:28,187 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 [2022-11-03 01:58:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:28,190 INFO L225 Difference]: With dead ends: 2166 [2022-11-03 01:58:28,190 INFO L226 Difference]: Without dead ends: 2166 [2022-11-03 01:58:28,190 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:58:28,191 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 204 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:28,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 26 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 01:58:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2022-11-03 01:58:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2062. [2022-11-03 01:58:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 2052 states have (on average 2.2743664717348926) internal successors, (4667), 2061 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 4667 transitions. [2022-11-03 01:58:28,217 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 4667 transitions. Word has length 18 [2022-11-03 01:58:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:28,217 INFO L495 AbstractCegarLoop]: Abstraction has 2062 states and 4667 transitions. [2022-11-03 01:58:28,217 INFO L496 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) [2022-11-03 01:58:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 4667 transitions. [2022-11-03 01:58:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:58:28,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:28,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:28,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-03 01:58:28,219 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:28,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:28,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1610104851, now seen corresponding path program 1 times [2022-11-03 01:58:28,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:28,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839022011] [2022-11-03 01:58:28,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:29,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:29,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839022011] [2022-11-03 01:58:29,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839022011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:29,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:29,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:58:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160050539] [2022-11-03 01:58:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:29,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:58:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:29,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:58:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:58:29,460 INFO L87 Difference]: Start difference. First operand 2062 states and 4667 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:30,461 INFO L93 Difference]: Finished difference Result 1898 states and 4289 transitions. [2022-11-03 01:58:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:58:30,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 01:58:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:30,464 INFO L225 Difference]: With dead ends: 1898 [2022-11-03 01:58:30,464 INFO L226 Difference]: Without dead ends: 1888 [2022-11-03 01:58:30,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:58:30,465 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 101 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:30,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 43 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:58:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-11-03 01:58:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1881. [2022-11-03 01:58:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1871 states have (on average 2.2741849278460715) internal successors, (4255), 1880 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4255 transitions. [2022-11-03 01:58:30,497 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4255 transitions. Word has length 18 [2022-11-03 01:58:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:30,497 INFO L495 AbstractCegarLoop]: Abstraction has 1881 states and 4255 transitions. [2022-11-03 01:58:30,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4255 transitions. [2022-11-03 01:58:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:58:30,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:30,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:30,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-03 01:58:30,499 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash 725725144, now seen corresponding path program 1 times [2022-11-03 01:58:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:30,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499107090] [2022-11-03 01:58:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:32,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:32,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499107090] [2022-11-03 01:58:32,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499107090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:32,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:32,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-03 01:58:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983899805] [2022-11-03 01:58:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:32,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 01:58:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:32,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 01:58:32,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:58:32,326 INFO L87 Difference]: Start difference. First operand 1881 states and 4255 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) [2022-11-03 01:58:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:38,019 INFO L93 Difference]: Finished difference Result 2515 states and 5664 transitions. [2022-11-03 01:58:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-03 01:58:38,019 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 [2022-11-03 01:58:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:38,022 INFO L225 Difference]: With dead ends: 2515 [2022-11-03 01:58:38,022 INFO L226 Difference]: Without dead ends: 2515 [2022-11-03 01:58:38,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=510, Invalid=2040, Unknown=0, NotChecked=0, Total=2550 [2022-11-03 01:58:38,024 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 407 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:38,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 45 Invalid, 3595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3530 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-03 01:58:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2022-11-03 01:58:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 1984. [2022-11-03 01:58:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1974 states have (on average 2.2760891590678827) internal successors, (4493), 1983 states have internal predecessors, (4493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 4493 transitions. [2022-11-03 01:58:38,053 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 4493 transitions. Word has length 20 [2022-11-03 01:58:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:38,053 INFO L495 AbstractCegarLoop]: Abstraction has 1984 states and 4493 transitions. [2022-11-03 01:58:38,054 INFO L496 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) [2022-11-03 01:58:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 4493 transitions. [2022-11-03 01:58:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:58:38,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:38,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:38,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-03 01:58:38,055 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1957495922, now seen corresponding path program 2 times [2022-11-03 01:58:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:38,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228920842] [2022-11-03 01:58:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:41,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:41,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228920842] [2022-11-03 01:58:41,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228920842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:41,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:41,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 01:58:41,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882967646] [2022-11-03 01:58:41,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:41,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 01:58:41,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:41,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 01:58:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:58:41,124 INFO L87 Difference]: Start difference. First operand 1984 states and 4493 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) [2022-11-03 01:58:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:45,835 INFO L93 Difference]: Finished difference Result 2492 states and 5628 transitions. [2022-11-03 01:58:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 01:58:45,836 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 [2022-11-03 01:58:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:45,840 INFO L225 Difference]: With dead ends: 2492 [2022-11-03 01:58:45,841 INFO L226 Difference]: Without dead ends: 2492 [2022-11-03 01:58:45,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 01:58:45,842 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 607 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:45,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 39 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-03 01:58:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2022-11-03 01:58:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 1989. [2022-11-03 01:58:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1979 states have (on average 2.2774128347650326) internal successors, (4507), 1988 states have internal predecessors, (4507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 4507 transitions. [2022-11-03 01:58:45,876 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 4507 transitions. Word has length 20 [2022-11-03 01:58:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:45,876 INFO L495 AbstractCegarLoop]: Abstraction has 1989 states and 4507 transitions. [2022-11-03 01:58:45,877 INFO L496 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) [2022-11-03 01:58:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 4507 transitions. [2022-11-03 01:58:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:58:45,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:45,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:45,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-03 01:58:45,879 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1875692170, now seen corresponding path program 3 times [2022-11-03 01:58:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:45,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400808400] [2022-11-03 01:58:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:49,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:49,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400808400] [2022-11-03 01:58:49,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400808400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:49,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:49,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 01:58:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121978864] [2022-11-03 01:58:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:49,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 01:58:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:49,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 01:58:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:58:49,441 INFO L87 Difference]: Start difference. First operand 1989 states and 4507 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) [2022-11-03 01:58:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:57,294 INFO L93 Difference]: Finished difference Result 2483 states and 5614 transitions. [2022-11-03 01:58:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 01:58:57,295 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 [2022-11-03 01:58:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:57,298 INFO L225 Difference]: With dead ends: 2483 [2022-11-03 01:58:57,298 INFO L226 Difference]: Without dead ends: 2483 [2022-11-03 01:58:57,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=291, Invalid=1191, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 01:58:57,299 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 498 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3911 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:57,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 61 Invalid, 3942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3911 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-03 01:58:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2022-11-03 01:58:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1989. [2022-11-03 01:58:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1979 states have (on average 2.2774128347650326) internal successors, (4507), 1988 states have internal predecessors, (4507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 4507 transitions. [2022-11-03 01:58:57,324 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 4507 transitions. Word has length 20 [2022-11-03 01:58:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:57,324 INFO L495 AbstractCegarLoop]: Abstraction has 1989 states and 4507 transitions. [2022-11-03 01:58:57,324 INFO L496 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) [2022-11-03 01:58:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 4507 transitions. [2022-11-03 01:58:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:58:57,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:57,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:57,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-03 01:58:57,326 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:58:57,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:57,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1199849958, now seen corresponding path program 4 times [2022-11-03 01:58:57,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:57,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299214649] [2022-11-03 01:58:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:59:01,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:01,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299214649] [2022-11-03 01:59:01,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299214649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:59:01,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:59:01,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-03 01:59:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111396117] [2022-11-03 01:59:01,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:01,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:59:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:01,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:59:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:59:01,289 INFO L87 Difference]: Start difference. First operand 1989 states and 4507 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) [2022-11-03 01:59:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:17,392 INFO L93 Difference]: Finished difference Result 2847 states and 6410 transitions. [2022-11-03 01:59:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-03 01:59:17,392 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 [2022-11-03 01:59:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:17,396 INFO L225 Difference]: With dead ends: 2847 [2022-11-03 01:59:17,396 INFO L226 Difference]: Without dead ends: 2847 [2022-11-03 01:59:17,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=401, Invalid=1761, Unknown=0, NotChecked=0, Total=2162 [2022-11-03 01:59:17,397 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 734 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:17,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 43 Invalid, 3507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-03 01:59:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2022-11-03 01:59:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1989. [2022-11-03 01:59:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1979 states have (on average 2.2774128347650326) internal successors, (4507), 1988 states have internal predecessors, (4507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 4507 transitions. [2022-11-03 01:59:17,424 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 4507 transitions. Word has length 20 [2022-11-03 01:59:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:17,424 INFO L495 AbstractCegarLoop]: Abstraction has 1989 states and 4507 transitions. [2022-11-03 01:59:17,424 INFO L496 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) [2022-11-03 01:59:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 4507 transitions. [2022-11-03 01:59:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:59:17,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:17,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:17,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-03 01:59:17,425 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:59:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:17,426 INFO L85 PathProgramCache]: Analyzing trace with hash 779618470, now seen corresponding path program 5 times [2022-11-03 01:59:17,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:17,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621925074] [2022-11-03 01:59:17,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:17,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:59:19,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:19,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621925074] [2022-11-03 01:59:19,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621925074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:59:19,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:59:19,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 01:59:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943411089] [2022-11-03 01:59:19,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:19,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 01:59:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:19,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 01:59:19,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:59:19,273 INFO L87 Difference]: Start difference. First operand 1989 states and 4507 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) [2022-11-03 01:59:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:24,386 INFO L93 Difference]: Finished difference Result 2802 states and 6319 transitions. [2022-11-03 01:59:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 01:59:24,387 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 [2022-11-03 01:59:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:24,390 INFO L225 Difference]: With dead ends: 2802 [2022-11-03 01:59:24,390 INFO L226 Difference]: Without dead ends: 2802 [2022-11-03 01:59:24,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 01:59:24,391 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 541 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 3935 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:24,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 41 Invalid, 3965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3935 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-03 01:59:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2022-11-03 01:59:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2020. [2022-11-03 01:59:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2010 states have (on average 2.2781094527363184) internal successors, (4579), 2019 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4579 transitions. [2022-11-03 01:59:24,441 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4579 transitions. Word has length 20 [2022-11-03 01:59:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:24,442 INFO L495 AbstractCegarLoop]: Abstraction has 2020 states and 4579 transitions. [2022-11-03 01:59:24,442 INFO L496 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) [2022-11-03 01:59:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4579 transitions. [2022-11-03 01:59:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:59:24,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:24,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:24,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-03 01:59:24,443 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:59:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1757758484, now seen corresponding path program 6 times [2022-11-03 01:59:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:24,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698920167] [2022-11-03 01:59:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:24,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:59:28,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:28,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698920167] [2022-11-03 01:59:28,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698920167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:59:28,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:59:28,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-03 01:59:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753316283] [2022-11-03 01:59:28,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:28,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:59:28,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:28,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:59:28,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:59:28,082 INFO L87 Difference]: Start difference. First operand 2020 states and 4579 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) [2022-11-03 01:59:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:38,028 INFO L93 Difference]: Finished difference Result 2516 states and 5663 transitions. [2022-11-03 01:59:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 01:59:38,029 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 [2022-11-03 01:59:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:38,032 INFO L225 Difference]: With dead ends: 2516 [2022-11-03 01:59:38,032 INFO L226 Difference]: Without dead ends: 2516 [2022-11-03 01:59:38,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 01:59:38,032 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 497 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 3982 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:38,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 45 Invalid, 4026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3982 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 01:59:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2022-11-03 01:59:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2020. [2022-11-03 01:59:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2010 states have (on average 2.2781094527363184) internal successors, (4579), 2019 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4579 transitions. [2022-11-03 01:59:38,056 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4579 transitions. Word has length 20 [2022-11-03 01:59:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:38,056 INFO L495 AbstractCegarLoop]: Abstraction has 2020 states and 4579 transitions. [2022-11-03 01:59:38,056 INFO L496 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) [2022-11-03 01:59:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4579 transitions. [2022-11-03 01:59:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:59:38,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:38,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:38,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-03 01:59:38,057 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:59:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -121937022, now seen corresponding path program 7 times [2022-11-03 01:59:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:38,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739457630] [2022-11-03 01:59:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:59:41,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:41,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739457630] [2022-11-03 01:59:41,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739457630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:59:41,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:59:41,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 01:59:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765553867] [2022-11-03 01:59:41,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:41,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 01:59:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 01:59:41,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:59:41,186 INFO L87 Difference]: Start difference. First operand 2020 states and 4579 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) [2022-11-03 01:59:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:46,270 INFO L93 Difference]: Finished difference Result 2549 states and 5739 transitions. [2022-11-03 01:59:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 01:59:46,270 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 [2022-11-03 01:59:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:46,273 INFO L225 Difference]: With dead ends: 2549 [2022-11-03 01:59:46,273 INFO L226 Difference]: Without dead ends: 2549 [2022-11-03 01:59:46,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=283, Invalid=1049, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 01:59:46,274 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 482 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 3012 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:46,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 41 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3012 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-03 01:59:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2022-11-03 01:59:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2022. [2022-11-03 01:59:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 2012 states have (on average 2.2778330019880717) internal successors, (4583), 2021 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 4583 transitions. [2022-11-03 01:59:46,296 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 4583 transitions. Word has length 20 [2022-11-03 01:59:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:46,296 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 4583 transitions. [2022-11-03 01:59:46,297 INFO L496 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) [2022-11-03 01:59:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 4583 transitions. [2022-11-03 01:59:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:59:46,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:46,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:46,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-03 01:59:46,298 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:59:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1114539000, now seen corresponding path program 8 times [2022-11-03 01:59:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:46,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995408871] [2022-11-03 01:59:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:59:47,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:47,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995408871] [2022-11-03 01:59:47,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995408871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:59:47,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:59:47,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 01:59:47,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417848168] [2022-11-03 01:59:47,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:47,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 01:59:47,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:47,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 01:59:47,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:59:47,676 INFO L87 Difference]: Start difference. First operand 2022 states and 4583 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) [2022-11-03 01:59:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:51,707 INFO L93 Difference]: Finished difference Result 2868 states and 6488 transitions. [2022-11-03 01:59:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 01:59:51,708 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 [2022-11-03 01:59:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:51,711 INFO L225 Difference]: With dead ends: 2868 [2022-11-03 01:59:51,711 INFO L226 Difference]: Without dead ends: 2868 [2022-11-03 01:59:51,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 01:59:51,712 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 460 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:51,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 33 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-03 01:59:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2022-11-03 01:59:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2055. [2022-11-03 01:59:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2045 states have (on average 2.284596577017115) internal successors, (4672), 2054 states have internal predecessors, (4672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4672 transitions. [2022-11-03 01:59:51,738 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4672 transitions. Word has length 20 [2022-11-03 01:59:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:51,738 INFO L495 AbstractCegarLoop]: Abstraction has 2055 states and 4672 transitions. [2022-11-03 01:59:51,738 INFO L496 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) [2022-11-03 01:59:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4672 transitions. [2022-11-03 01:59:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:59:51,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:51,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:51,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-03 01:59:51,739 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:59:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash -145350504, now seen corresponding path program 9 times [2022-11-03 01:59:51,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:51,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861813001] [2022-11-03 01:59:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:51,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:59:54,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:54,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861813001] [2022-11-03 01:59:54,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861813001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:59:54,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:59:54,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-03 01:59:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20652846] [2022-11-03 01:59:54,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:54,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:59:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:54,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:59:54,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:59:54,129 INFO L87 Difference]: Start difference. First operand 2055 states and 4672 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) [2022-11-03 01:59:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:59,267 INFO L93 Difference]: Finished difference Result 2877 states and 6525 transitions. [2022-11-03 01:59:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 01:59:59,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 [2022-11-03 01:59:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:59,271 INFO L225 Difference]: With dead ends: 2877 [2022-11-03 01:59:59,271 INFO L226 Difference]: Without dead ends: 2877 [2022-11-03 01:59:59,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=363, Invalid=1359, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 01:59:59,272 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 492 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 2864 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:59,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 49 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2864 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-03 01:59:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2022-11-03 01:59:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2092. [2022-11-03 01:59:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2082 states have (on average 2.281940441882805) internal successors, (4751), 2091 states have internal predecessors, (4751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:59:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 4751 transitions. [2022-11-03 01:59:59,306 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 4751 transitions. Word has length 20 [2022-11-03 01:59:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:59,306 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 4751 transitions. [2022-11-03 01:59:59,306 INFO L496 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) [2022-11-03 01:59:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 4751 transitions. [2022-11-03 01:59:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:59:59,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:59,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:59,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-03 01:59:59,308 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 01:59:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash 973595934, now seen corresponding path program 10 times [2022-11-03 01:59:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:59,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216111866] [2022-11-03 01:59:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:00:01,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:00:01,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216111866] [2022-11-03 02:00:01,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216111866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:00:01,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:00:01,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-03 02:00:01,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35705576] [2022-11-03 02:00:01,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:00:01,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:00:01,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:00:01,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:00:01,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:00:01,183 INFO L87 Difference]: Start difference. First operand 2092 states and 4751 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) [2022-11-03 02:00:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:05,535 INFO L93 Difference]: Finished difference Result 2597 states and 5893 transitions. [2022-11-03 02:00:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:00:05,536 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 [2022-11-03 02:00:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:05,539 INFO L225 Difference]: With dead ends: 2597 [2022-11-03 02:00:05,539 INFO L226 Difference]: Without dead ends: 2597 [2022-11-03 02:00:05,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:00:05,540 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 361 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3486 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:05,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 57 Invalid, 3518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3486 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-03 02:00:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2022-11-03 02:00:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2083. [2022-11-03 02:00:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2073 states have (on average 2.2807525325615052) internal successors, (4728), 2082 states have internal predecessors, (4728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:00:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 4728 transitions. [2022-11-03 02:00:05,564 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 4728 transitions. Word has length 20 [2022-11-03 02:00:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:05,564 INFO L495 AbstractCegarLoop]: Abstraction has 2083 states and 4728 transitions. [2022-11-03 02:00:05,564 INFO L496 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) [2022-11-03 02:00:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 4728 transitions. [2022-11-03 02:00:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:00:05,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:05,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:00:05,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-03 02:00:05,566 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:00:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1086420274, now seen corresponding path program 11 times [2022-11-03 02:00:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:00:05,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113638282] [2022-11-03 02:00:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:00:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:00:08,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:00:08,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113638282] [2022-11-03 02:00:08,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113638282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:00:08,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:00:08,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 02:00:08,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881654251] [2022-11-03 02:00:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:00:08,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:00:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:00:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:00:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:00:08,453 INFO L87 Difference]: Start difference. First operand 2083 states and 4728 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) [2022-11-03 02:00:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:15,327 INFO L93 Difference]: Finished difference Result 2996 states and 6801 transitions. [2022-11-03 02:00:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:00:15,327 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 [2022-11-03 02:00:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:15,331 INFO L225 Difference]: With dead ends: 2996 [2022-11-03 02:00:15,331 INFO L226 Difference]: Without dead ends: 2996 [2022-11-03 02:00:15,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 02:00:15,331 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 476 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:15,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 57 Invalid, 3597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-03 02:00:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2022-11-03 02:00:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2105. [2022-11-03 02:00:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2095 states have (on average 2.279236276849642) internal successors, (4775), 2104 states have internal predecessors, (4775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:00:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 4775 transitions. [2022-11-03 02:00:15,358 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 4775 transitions. Word has length 20 [2022-11-03 02:00:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:15,359 INFO L495 AbstractCegarLoop]: Abstraction has 2105 states and 4775 transitions. [2022-11-03 02:00:15,359 INFO L496 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) [2022-11-03 02:00:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 4775 transitions. [2022-11-03 02:00:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:00:15,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:15,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:00:15,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-03 02:00:15,360 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:00:15,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1109544594, now seen corresponding path program 12 times [2022-11-03 02:00:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:00:15,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438405515] [2022-11-03 02:00:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:15,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:00:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:00:17,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:00:17,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438405515] [2022-11-03 02:00:17,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438405515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:00:17,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:00:17,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-03 02:00:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681660058] [2022-11-03 02:00:17,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:00:17,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:00:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:00:17,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:00:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:00:17,324 INFO L87 Difference]: Start difference. First operand 2105 states and 4775 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) [2022-11-03 02:00:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:21,695 INFO L93 Difference]: Finished difference Result 3116 states and 7079 transitions. [2022-11-03 02:00:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 02:00:21,696 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 [2022-11-03 02:00:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:21,699 INFO L225 Difference]: With dead ends: 3116 [2022-11-03 02:00:21,699 INFO L226 Difference]: Without dead ends: 3116 [2022-11-03 02:00:21,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 02:00:21,700 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 325 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:21,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 55 Invalid, 2723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-03 02:00:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2022-11-03 02:00:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 2115. [2022-11-03 02:00:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 2105 states have (on average 2.2807600950118765) internal successors, (4801), 2114 states have internal predecessors, (4801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:00:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 4801 transitions. [2022-11-03 02:00:21,728 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 4801 transitions. Word has length 20 [2022-11-03 02:00:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:21,728 INFO L495 AbstractCegarLoop]: Abstraction has 2115 states and 4801 transitions. [2022-11-03 02:00:21,728 INFO L496 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) [2022-11-03 02:00:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 4801 transitions. [2022-11-03 02:00:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:00:21,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:21,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:00:21,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-03 02:00:21,730 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:00:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash 435714, now seen corresponding path program 13 times [2022-11-03 02:00:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:00:21,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273260615] [2022-11-03 02:00:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:00:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:00:25,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:00:25,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273260615] [2022-11-03 02:00:25,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273260615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:00:25,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:00:25,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-03 02:00:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561736961] [2022-11-03 02:00:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:00:25,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:00:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:00:25,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:00:25,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:00:25,933 INFO L87 Difference]: Start difference. First operand 2115 states and 4801 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) [2022-11-03 02:00:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:32,757 INFO L93 Difference]: Finished difference Result 2573 states and 5838 transitions. [2022-11-03 02:00:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 02:00:32,757 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 [2022-11-03 02:00:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:32,760 INFO L225 Difference]: With dead ends: 2573 [2022-11-03 02:00:32,760 INFO L226 Difference]: Without dead ends: 2573 [2022-11-03 02:00:32,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:00:32,761 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 351 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:32,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 63 Invalid, 3753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-03 02:00:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2022-11-03 02:00:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2133. [2022-11-03 02:00:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2123 states have (on average 2.278379651436646) internal successors, (4837), 2132 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:00:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 4837 transitions. [2022-11-03 02:00:32,790 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 4837 transitions. Word has length 20 [2022-11-03 02:00:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:32,791 INFO L495 AbstractCegarLoop]: Abstraction has 2133 states and 4837 transitions. [2022-11-03 02:00:32,791 INFO L496 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) [2022-11-03 02:00:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 4837 transitions. [2022-11-03 02:00:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:00:32,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:32,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:00:32,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-03 02:00:32,792 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:00:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 122226184, now seen corresponding path program 14 times [2022-11-03 02:00:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:00:32,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075231965] [2022-11-03 02:00:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:00:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:00:36,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:00:36,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075231965] [2022-11-03 02:00:36,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075231965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:00:36,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:00:36,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 02:00:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784861277] [2022-11-03 02:00:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:00:36,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:00:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:00:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:00:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:00:36,371 INFO L87 Difference]: Start difference. First operand 2133 states and 4837 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) [2022-11-03 02:00:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:42,479 INFO L93 Difference]: Finished difference Result 2705 states and 6135 transitions. [2022-11-03 02:00:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 02:00:42,479 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 [2022-11-03 02:00:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:42,483 INFO L225 Difference]: With dead ends: 2705 [2022-11-03 02:00:42,483 INFO L226 Difference]: Without dead ends: 2705 [2022-11-03 02:00:42,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2022-11-03 02:00:42,483 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 525 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 2986 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:42,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 57 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2986 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-03 02:00:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2022-11-03 02:00:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2041. [2022-11-03 02:00:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2031 states have (on average 2.2752338749384537) internal successors, (4621), 2040 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:00:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 4621 transitions. [2022-11-03 02:00:42,515 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 4621 transitions. Word has length 20 [2022-11-03 02:00:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:42,515 INFO L495 AbstractCegarLoop]: Abstraction has 2041 states and 4621 transitions. [2022-11-03 02:00:42,515 INFO L496 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) [2022-11-03 02:00:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 4621 transitions. [2022-11-03 02:00:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:00:42,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:42,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:00:42,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-03 02:00:42,516 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:00:42,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1022771715, now seen corresponding path program 1 times [2022-11-03 02:00:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:00:42,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950968458] [2022-11-03 02:00:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:00:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:00:47,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:00:47,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950968458] [2022-11-03 02:00:47,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950968458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:00:47,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:00:47,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-03 02:00:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520749123] [2022-11-03 02:00:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:00:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:00:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:00:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:00:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:00:47,098 INFO L87 Difference]: Start difference. First operand 2041 states and 4621 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) [2022-11-03 02:00:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:59,505 INFO L93 Difference]: Finished difference Result 2931 states and 6626 transitions. [2022-11-03 02:00:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-03 02:00:59,505 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 [2022-11-03 02:00:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:59,509 INFO L225 Difference]: With dead ends: 2931 [2022-11-03 02:00:59,509 INFO L226 Difference]: Without dead ends: 2931 [2022-11-03 02:00:59,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=488, Invalid=2164, Unknown=0, NotChecked=0, Total=2652 [2022-11-03 02:00:59,510 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 455 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 4729 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:59,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 53 Invalid, 4773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4729 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-03 02:00:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2022-11-03 02:00:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2074. [2022-11-03 02:00:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2064 states have (on average 2.2727713178294575) internal successors, (4691), 2073 states have internal predecessors, (4691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:00:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 4691 transitions. [2022-11-03 02:00:59,536 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 4691 transitions. Word has length 21 [2022-11-03 02:00:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:59,537 INFO L495 AbstractCegarLoop]: Abstraction has 2074 states and 4691 transitions. [2022-11-03 02:00:59,537 INFO L496 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) [2022-11-03 02:00:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 4691 transitions. [2022-11-03 02:00:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:00:59,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:59,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:00:59,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-03 02:00:59,538 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:00:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1223193793, now seen corresponding path program 1 times [2022-11-03 02:00:59,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:00:59,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141373548] [2022-11-03 02:00:59,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:00:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:00,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:00,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141373548] [2022-11-03 02:01:00,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141373548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:00,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:00,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:01:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243408538] [2022-11-03 02:01:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:00,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:01:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:00,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:01:00,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:01:00,746 INFO L87 Difference]: Start difference. First operand 2074 states and 4691 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) [2022-11-03 02:01:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:02,755 INFO L93 Difference]: Finished difference Result 2217 states and 4946 transitions. [2022-11-03 02:01:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:01:02,756 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 [2022-11-03 02:01:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:02,758 INFO L225 Difference]: With dead ends: 2217 [2022-11-03 02:01:02,758 INFO L226 Difference]: Without dead ends: 2164 [2022-11-03 02:01:02,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:01:02,759 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 118 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:02,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 45 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1895 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-03 02:01:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-11-03 02:01:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2092. [2022-11-03 02:01:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2082 states have (on average 2.271373679154659) internal successors, (4729), 2091 states have internal predecessors, (4729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 4729 transitions. [2022-11-03 02:01:02,793 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 4729 transitions. Word has length 21 [2022-11-03 02:01:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:02,794 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 4729 transitions. [2022-11-03 02:01:02,794 INFO L496 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) [2022-11-03 02:01:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 4729 transitions. [2022-11-03 02:01:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:01:02,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:02,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:02,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-03 02:01:02,796 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:01:02,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash 484950199, now seen corresponding path program 2 times [2022-11-03 02:01:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:02,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449861025] [2022-11-03 02:01:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:07,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:07,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449861025] [2022-11-03 02:01:07,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449861025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:07,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:07,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-03 02:01:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939443880] [2022-11-03 02:01:07,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:07,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:01:07,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:07,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:01:07,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:01:07,491 INFO L87 Difference]: Start difference. First operand 2092 states and 4729 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) [2022-11-03 02:01:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:19,029 INFO L93 Difference]: Finished difference Result 3442 states and 7789 transitions. [2022-11-03 02:01:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-03 02:01:19,030 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 [2022-11-03 02:01:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:19,033 INFO L225 Difference]: With dead ends: 3442 [2022-11-03 02:01:19,034 INFO L226 Difference]: Without dead ends: 3442 [2022-11-03 02:01:19,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=706, Invalid=2954, Unknown=0, NotChecked=0, Total=3660 [2022-11-03 02:01:19,034 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 737 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 4064 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:19,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 43 Invalid, 4151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4064 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-03 02:01:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2022-11-03 02:01:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 2257. [2022-11-03 02:01:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2247 states have (on average 2.282599020916778) internal successors, (5129), 2256 states have internal predecessors, (5129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 5129 transitions. [2022-11-03 02:01:19,080 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 5129 transitions. Word has length 21 [2022-11-03 02:01:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:19,081 INFO L495 AbstractCegarLoop]: Abstraction has 2257 states and 5129 transitions. [2022-11-03 02:01:19,081 INFO L496 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) [2022-11-03 02:01:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 5129 transitions. [2022-11-03 02:01:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:01:19,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:19,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:19,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-03 02:01:19,083 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:01:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash 552960169, now seen corresponding path program 3 times [2022-11-03 02:01:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:19,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831075129] [2022-11-03 02:01:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:21,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:21,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831075129] [2022-11-03 02:01:21,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831075129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:21,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:21,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-03 02:01:21,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824491068] [2022-11-03 02:01:21,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:21,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:01:21,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:21,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:01:21,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:01:21,045 INFO L87 Difference]: Start difference. First operand 2257 states and 5129 transitions. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:24,497 INFO L93 Difference]: Finished difference Result 3278 states and 7415 transitions. [2022-11-03 02:01:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:01:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:01:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:24,502 INFO L225 Difference]: With dead ends: 3278 [2022-11-03 02:01:24,502 INFO L226 Difference]: Without dead ends: 3278 [2022-11-03 02:01:24,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 02:01:24,503 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 738 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:24,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 47 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 02:01:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2022-11-03 02:01:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 2069. [2022-11-03 02:01:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2059 states have (on average 2.2714910150558523) internal successors, (4677), 2068 states have internal predecessors, (4677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 4677 transitions. [2022-11-03 02:01:24,533 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 4677 transitions. Word has length 21 [2022-11-03 02:01:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:24,534 INFO L495 AbstractCegarLoop]: Abstraction has 2069 states and 4677 transitions. [2022-11-03 02:01:24,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 4677 transitions. [2022-11-03 02:01:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:01:24,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:24,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:24,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-03 02:01:24,536 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:01:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2050966113, now seen corresponding path program 4 times [2022-11-03 02:01:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:24,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446846308] [2022-11-03 02:01:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:24,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:28,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:28,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446846308] [2022-11-03 02:01:28,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446846308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:28,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:28,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-03 02:01:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493311400] [2022-11-03 02:01:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:28,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:01:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:01:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:01:28,392 INFO L87 Difference]: Start difference. First operand 2069 states and 4677 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) [2022-11-03 02:01:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:41,669 INFO L93 Difference]: Finished difference Result 3279 states and 7384 transitions. [2022-11-03 02:01:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-03 02:01:41,670 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 [2022-11-03 02:01:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:41,673 INFO L225 Difference]: With dead ends: 3279 [2022-11-03 02:01:41,673 INFO L226 Difference]: Without dead ends: 3279 [2022-11-03 02:01:41,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=782, Invalid=3250, Unknown=0, NotChecked=0, Total=4032 [2022-11-03 02:01:41,674 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 925 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 3981 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:41,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 57 Invalid, 4119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 3981 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-03 02:01:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-11-03 02:01:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2227. [2022-11-03 02:01:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2217 states have (on average 2.2837167343256652) internal successors, (5063), 2226 states have internal predecessors, (5063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 5063 transitions. [2022-11-03 02:01:41,700 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 5063 transitions. Word has length 21 [2022-11-03 02:01:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:41,700 INFO L495 AbstractCegarLoop]: Abstraction has 2227 states and 5063 transitions. [2022-11-03 02:01:41,701 INFO L496 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) [2022-11-03 02:01:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 5063 transitions. [2022-11-03 02:01:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:01:41,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:41,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:41,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-03 02:01:41,702 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:01:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1982956143, now seen corresponding path program 5 times [2022-11-03 02:01:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:41,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189825154] [2022-11-03 02:01:41,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:41,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:44,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:44,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189825154] [2022-11-03 02:01:44,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189825154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:44,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:44,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-03 02:01:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961962202] [2022-11-03 02:01:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:44,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:01:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:44,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:01:44,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:01:44,567 INFO L87 Difference]: Start difference. First operand 2227 states and 5063 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) [2022-11-03 02:01:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:51,526 INFO L93 Difference]: Finished difference Result 3434 states and 7815 transitions. [2022-11-03 02:01:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 02:01:51,527 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 [2022-11-03 02:01:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:51,531 INFO L225 Difference]: With dead ends: 3434 [2022-11-03 02:01:51,531 INFO L226 Difference]: Without dead ends: 3434 [2022-11-03 02:01:51,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 02:01:51,532 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 442 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 4470 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:51,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 51 Invalid, 4510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4470 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-03 02:01:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-11-03 02:01:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 2055. [2022-11-03 02:01:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2045 states have (on average 2.2733496332518337) internal successors, (4649), 2054 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4649 transitions. [2022-11-03 02:01:51,565 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4649 transitions. Word has length 21 [2022-11-03 02:01:51,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:51,566 INFO L495 AbstractCegarLoop]: Abstraction has 2055 states and 4649 transitions. [2022-11-03 02:01:51,566 INFO L496 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) [2022-11-03 02:01:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4649 transitions. [2022-11-03 02:01:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:01:51,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:51,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:51,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-03 02:01:51,567 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:01:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1527238205, now seen corresponding path program 6 times [2022-11-03 02:01:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:51,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880490510] [2022-11-03 02:01:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:01:54,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:54,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880490510] [2022-11-03 02:01:54,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880490510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:54,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:54,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-03 02:01:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186838522] [2022-11-03 02:01:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:54,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:01:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:01:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:01:54,816 INFO L87 Difference]: Start difference. First operand 2055 states and 4649 transitions. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:06,585 INFO L93 Difference]: Finished difference Result 3414 states and 7696 transitions. [2022-11-03 02:02:06,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-03 02:02:06,586 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:02:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:06,590 INFO L225 Difference]: With dead ends: 3414 [2022-11-03 02:02:06,590 INFO L226 Difference]: Without dead ends: 3414 [2022-11-03 02:02:06,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=858, Invalid=3174, Unknown=0, NotChecked=0, Total=4032 [2022-11-03 02:02:06,591 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 898 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3853 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 3853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:06,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 43 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 3853 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-03 02:02:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2022-11-03 02:02:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 2168. [2022-11-03 02:02:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2158 states have (on average 2.2859128822984243) internal successors, (4933), 2167 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4933 transitions. [2022-11-03 02:02:06,619 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4933 transitions. Word has length 21 [2022-11-03 02:02:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:06,619 INFO L495 AbstractCegarLoop]: Abstraction has 2168 states and 4933 transitions. [2022-11-03 02:02:06,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4933 transitions. [2022-11-03 02:02:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:02:06,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:06,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:06,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-03 02:02:06,621 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:02:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1459228235, now seen corresponding path program 7 times [2022-11-03 02:02:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:06,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871955539] [2022-11-03 02:02:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:07,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:07,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871955539] [2022-11-03 02:02:07,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871955539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:07,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:07,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 02:02:07,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744659523] [2022-11-03 02:02:07,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:07,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:02:07,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:07,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:02:07,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:02:07,890 INFO L87 Difference]: Start difference. First operand 2168 states and 4933 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) [2022-11-03 02:02:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:12,153 INFO L93 Difference]: Finished difference Result 3674 states and 8295 transitions. [2022-11-03 02:02:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 02:02:12,154 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 [2022-11-03 02:02:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:12,158 INFO L225 Difference]: With dead ends: 3674 [2022-11-03 02:02:12,158 INFO L226 Difference]: Without dead ends: 3674 [2022-11-03 02:02:12,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 02:02:12,159 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 598 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 3626 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:12,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 61 Invalid, 3670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3626 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-03 02:02:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2022-11-03 02:02:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2055. [2022-11-03 02:02:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2045 states have (on average 2.2733496332518337) internal successors, (4649), 2054 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4649 transitions. [2022-11-03 02:02:12,189 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4649 transitions. Word has length 21 [2022-11-03 02:02:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:12,189 INFO L495 AbstractCegarLoop]: Abstraction has 2055 states and 4649 transitions. [2022-11-03 02:02:12,189 INFO L496 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) [2022-11-03 02:02:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4649 transitions. [2022-11-03 02:02:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:02:12,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:12,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:12,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-03 02:02:12,190 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:02:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1276180605, now seen corresponding path program 8 times [2022-11-03 02:02:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:12,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057619078] [2022-11-03 02:02:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:15,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:15,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057619078] [2022-11-03 02:02:15,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057619078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:15,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:15,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-03 02:02:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338655391] [2022-11-03 02:02:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:15,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:02:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:15,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:02:15,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:02:15,474 INFO L87 Difference]: Start difference. First operand 2055 states and 4649 transitions. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:26,037 INFO L93 Difference]: Finished difference Result 3132 states and 7067 transitions. [2022-11-03 02:02:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-03 02:02:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:02:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:26,042 INFO L225 Difference]: With dead ends: 3132 [2022-11-03 02:02:26,042 INFO L226 Difference]: Without dead ends: 3132 [2022-11-03 02:02:26,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=602, Invalid=2154, Unknown=0, NotChecked=0, Total=2756 [2022-11-03 02:02:26,043 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 613 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 4833 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 4882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 4833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:26,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 43 Invalid, 4882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 4833 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-03 02:02:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2022-11-03 02:02:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 2057. [2022-11-03 02:02:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2047 states have (on average 2.2740595994137762) internal successors, (4655), 2056 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 4655 transitions. [2022-11-03 02:02:26,076 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 4655 transitions. Word has length 21 [2022-11-03 02:02:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:26,076 INFO L495 AbstractCegarLoop]: Abstraction has 2057 states and 4655 transitions. [2022-11-03 02:02:26,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 4655 transitions. [2022-11-03 02:02:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:02:26,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:26,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:26,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-03 02:02:26,078 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:02:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash -10347519, now seen corresponding path program 2 times [2022-11-03 02:02:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:26,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896521794] [2022-11-03 02:02:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:27,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:27,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896521794] [2022-11-03 02:02:27,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896521794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:27,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:27,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 02:02:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122053696] [2022-11-03 02:02:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:27,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:02:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:02:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:02:27,232 INFO L87 Difference]: Start difference. First operand 2057 states and 4655 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:29,543 INFO L93 Difference]: Finished difference Result 2192 states and 4892 transitions. [2022-11-03 02:02:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 02:02:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:02:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:29,546 INFO L225 Difference]: With dead ends: 2192 [2022-11-03 02:02:29,547 INFO L226 Difference]: Without dead ends: 2139 [2022-11-03 02:02:29,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:02:29,547 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 143 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:29,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 55 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 02:02:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2022-11-03 02:02:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2059. [2022-11-03 02:02:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 2049 states have (on average 2.273792093704246) internal successors, (4659), 2058 states have internal predecessors, (4659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 4659 transitions. [2022-11-03 02:02:29,581 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 4659 transitions. Word has length 21 [2022-11-03 02:02:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:29,582 INFO L495 AbstractCegarLoop]: Abstraction has 2059 states and 4659 transitions. [2022-11-03 02:02:29,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 4659 transitions. [2022-11-03 02:02:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:02:29,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:29,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:29,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-03 02:02:29,584 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:02:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash 527478141, now seen corresponding path program 3 times [2022-11-03 02:02:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:29,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796301625] [2022-11-03 02:02:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:30,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:30,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796301625] [2022-11-03 02:02:30,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796301625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:30,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:30,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:02:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168692008] [2022-11-03 02:02:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:30,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:02:30,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:30,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:02:30,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:02:30,649 INFO L87 Difference]: Start difference. First operand 2059 states and 4659 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) [2022-11-03 02:02:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:33,118 INFO L93 Difference]: Finished difference Result 2074 states and 4689 transitions. [2022-11-03 02:02:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:02:33,118 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 [2022-11-03 02:02:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:33,121 INFO L225 Difference]: With dead ends: 2074 [2022-11-03 02:02:33,122 INFO L226 Difference]: Without dead ends: 2074 [2022-11-03 02:02:33,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:02:33,122 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:33,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 02:02:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2022-11-03 02:02:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2062. [2022-11-03 02:02:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 2052 states have (on average 2.2733918128654973) internal successors, (4665), 2061 states have internal predecessors, (4665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 4665 transitions. [2022-11-03 02:02:33,146 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 4665 transitions. Word has length 21 [2022-11-03 02:02:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:33,147 INFO L495 AbstractCegarLoop]: Abstraction has 2062 states and 4665 transitions. [2022-11-03 02:02:33,147 INFO L496 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) [2022-11-03 02:02:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 4665 transitions. [2022-11-03 02:02:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:02:33,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:33,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-03 02:02:33,148 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:02:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1914741977, now seen corresponding path program 4 times [2022-11-03 02:02:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:33,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118624537] [2022-11-03 02:02:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:34,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:34,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118624537] [2022-11-03 02:02:34,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118624537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:34,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:34,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 02:02:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399938098] [2022-11-03 02:02:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:34,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 02:02:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 02:02:34,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:02:34,643 INFO L87 Difference]: Start difference. First operand 2062 states and 4665 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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) [2022-11-03 02:02:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:37,513 INFO L93 Difference]: Finished difference Result 2191 states and 4890 transitions. [2022-11-03 02:02:37,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 02:02:37,513 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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 [2022-11-03 02:02:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:37,516 INFO L225 Difference]: With dead ends: 2191 [2022-11-03 02:02:37,516 INFO L226 Difference]: Without dead ends: 2138 [2022-11-03 02:02:37,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:02:37,517 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 148 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:37,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 54 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 02:02:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-11-03 02:02:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2058. [2022-11-03 02:02:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2048 states have (on average 2.27294921875) internal successors, (4655), 2057 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 4655 transitions. [2022-11-03 02:02:37,556 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 4655 transitions. Word has length 21 [2022-11-03 02:02:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:37,556 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 4655 transitions. [2022-11-03 02:02:37,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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) [2022-11-03 02:02:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 4655 transitions. [2022-11-03 02:02:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:02:37,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:37,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:37,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-03 02:02:37,558 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:02:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash 13635865, now seen corresponding path program 9 times [2022-11-03 02:02:37,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:37,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997820635] [2022-11-03 02:02:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:41,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:41,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997820635] [2022-11-03 02:02:41,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997820635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:41,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:41,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-03 02:02:41,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559384930] [2022-11-03 02:02:41,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:41,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:02:41,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:41,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:02:41,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:02:41,218 INFO L87 Difference]: Start difference. First operand 2058 states and 4655 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) [2022-11-03 02:02:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:49,517 INFO L93 Difference]: Finished difference Result 3044 states and 6901 transitions. [2022-11-03 02:02:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 02:02:49,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 [2022-11-03 02:02:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:49,522 INFO L225 Difference]: With dead ends: 3044 [2022-11-03 02:02:49,522 INFO L226 Difference]: Without dead ends: 3044 [2022-11-03 02:02:49,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 02:02:49,522 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 520 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3968 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:49,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 55 Invalid, 4027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3968 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-03 02:02:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-11-03 02:02:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2085. [2022-11-03 02:02:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2075 states have (on average 2.2674698795180723) internal successors, (4705), 2084 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 4705 transitions. [2022-11-03 02:02:49,553 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 4705 transitions. Word has length 21 [2022-11-03 02:02:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:49,553 INFO L495 AbstractCegarLoop]: Abstraction has 2085 states and 4705 transitions. [2022-11-03 02:02:49,553 INFO L496 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) [2022-11-03 02:02:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 4705 transitions. [2022-11-03 02:02:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:02:49,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:49,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:49,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-03 02:02:49,554 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:02:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash 164406763, now seen corresponding path program 5 times [2022-11-03 02:02:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:49,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452350753] [2022-11-03 02:02:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:51,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:51,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452350753] [2022-11-03 02:02:51,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452350753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:51,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:51,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 02:02:51,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634001400] [2022-11-03 02:02:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:51,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:02:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:02:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:02:51,225 INFO L87 Difference]: Start difference. First operand 2085 states and 4705 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:54,431 INFO L93 Difference]: Finished difference Result 2230 states and 4962 transitions. [2022-11-03 02:02:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:02:54,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:02:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:54,441 INFO L225 Difference]: With dead ends: 2230 [2022-11-03 02:02:54,441 INFO L226 Difference]: Without dead ends: 2177 [2022-11-03 02:02:54,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2022-11-03 02:02:54,441 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 170 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:54,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 52 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 02:02:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2022-11-03 02:02:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2087. [2022-11-03 02:02:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 2077 states have (on average 2.267212325469427) internal successors, (4709), 2086 states have internal predecessors, (4709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 4709 transitions. [2022-11-03 02:02:54,466 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 4709 transitions. Word has length 21 [2022-11-03 02:02:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:54,466 INFO L495 AbstractCegarLoop]: Abstraction has 2087 states and 4709 transitions. [2022-11-03 02:02:54,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 4709 transitions. [2022-11-03 02:02:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:02:54,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:54,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:54,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-03 02:02:54,468 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:02:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -573836831, now seen corresponding path program 10 times [2022-11-03 02:02:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:54,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964261181] [2022-11-03 02:02:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:58,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:58,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964261181] [2022-11-03 02:02:58,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964261181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:02:58,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:02:58,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-03 02:02:58,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447958207] [2022-11-03 02:02:58,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:02:58,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:02:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:02:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:02:58,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:02:58,512 INFO L87 Difference]: Start difference. First operand 2087 states and 4709 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) [2022-11-03 02:03:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:10,492 INFO L93 Difference]: Finished difference Result 3375 states and 7617 transitions. [2022-11-03 02:03:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-03 02:03:10,492 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 [2022-11-03 02:03:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:10,496 INFO L225 Difference]: With dead ends: 3375 [2022-11-03 02:03:10,497 INFO L226 Difference]: Without dead ends: 3375 [2022-11-03 02:03:10,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=495, Invalid=2157, Unknown=0, NotChecked=0, Total=2652 [2022-11-03 02:03:10,498 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 665 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:10,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 51 Invalid, 4407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-03 02:03:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states. [2022-11-03 02:03:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 2168. [2022-11-03 02:03:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2158 states have (on average 2.27386468952734) internal successors, (4907), 2167 states have internal predecessors, (4907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4907 transitions. [2022-11-03 02:03:10,530 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4907 transitions. Word has length 21 [2022-11-03 02:03:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:10,530 INFO L495 AbstractCegarLoop]: Abstraction has 2168 states and 4907 transitions. [2022-11-03 02:03:10,531 INFO L496 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) [2022-11-03 02:03:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4907 transitions. [2022-11-03 02:03:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:03:10,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:10,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:10,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-11-03 02:03:10,532 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:03:10,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:10,533 INFO L85 PathProgramCache]: Analyzing trace with hash -505826861, now seen corresponding path program 11 times [2022-11-03 02:03:10,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:10,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827544964] [2022-11-03 02:03:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:10,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:14,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:14,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827544964] [2022-11-03 02:03:14,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827544964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:03:14,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:03:14,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-03 02:03:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105137635] [2022-11-03 02:03:14,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:03:14,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:03:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:03:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:03:14,204 INFO L87 Difference]: Start difference. First operand 2168 states and 4907 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) [2022-11-03 02:03:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:21,484 INFO L93 Difference]: Finished difference Result 3153 states and 7120 transitions. [2022-11-03 02:03:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 02:03:21,484 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 [2022-11-03 02:03:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:21,488 INFO L225 Difference]: With dead ends: 3153 [2022-11-03 02:03:21,488 INFO L226 Difference]: Without dead ends: 3153 [2022-11-03 02:03:21,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 02:03:21,489 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 766 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:21,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 53 Invalid, 3661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-03 02:03:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2022-11-03 02:03:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1983. [2022-11-03 02:03:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1973 states have (on average 2.2630511910795743) internal successors, (4465), 1982 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 4465 transitions. [2022-11-03 02:03:21,519 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 4465 transitions. Word has length 21 [2022-11-03 02:03:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:21,519 INFO L495 AbstractCegarLoop]: Abstraction has 1983 states and 4465 transitions. [2022-11-03 02:03:21,519 INFO L496 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) [2022-11-03 02:03:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 4465 transitions. [2022-11-03 02:03:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:03:21,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:21,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:21,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-11-03 02:03:21,521 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:03:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:21,521 INFO L85 PathProgramCache]: Analyzing trace with hash 702232423, now seen corresponding path program 6 times [2022-11-03 02:03:21,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:21,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648535932] [2022-11-03 02:03:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:21,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:22,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:22,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648535932] [2022-11-03 02:03:22,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648535932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:03:22,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:03:22,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:03:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566381817] [2022-11-03 02:03:22,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:03:22,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:03:22,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:22,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:03:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:03:22,848 INFO L87 Difference]: Start difference. First operand 1983 states and 4465 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) [2022-11-03 02:03:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:26,000 INFO L93 Difference]: Finished difference Result 2731 states and 6030 transitions. [2022-11-03 02:03:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:03:26,000 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 [2022-11-03 02:03:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:26,003 INFO L225 Difference]: With dead ends: 2731 [2022-11-03 02:03:26,003 INFO L226 Difference]: Without dead ends: 2678 [2022-11-03 02:03:26,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:03:26,004 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 194 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:26,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 41 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-03 02:03:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2022-11-03 02:03:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 1976. [2022-11-03 02:03:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1966 states have (on average 2.263987792472024) internal successors, (4451), 1975 states have internal predecessors, (4451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4451 transitions. [2022-11-03 02:03:26,030 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4451 transitions. Word has length 21 [2022-11-03 02:03:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:26,030 INFO L495 AbstractCegarLoop]: Abstraction has 1976 states and 4451 transitions. [2022-11-03 02:03:26,031 INFO L496 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) [2022-11-03 02:03:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4451 transitions. [2022-11-03 02:03:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:03:26,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:26,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:26,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-03 02:03:26,032 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:03:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:26,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2089496259, now seen corresponding path program 7 times [2022-11-03 02:03:26,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:26,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961780724] [2022-11-03 02:03:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:27,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:27,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961780724] [2022-11-03 02:03:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961780724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:03:27,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:03:27,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:03:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125287479] [2022-11-03 02:03:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:03:27,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:03:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:03:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:03:27,386 INFO L87 Difference]: Start difference. First operand 1976 states and 4451 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) [2022-11-03 02:03:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:28,857 INFO L93 Difference]: Finished difference Result 2108 states and 4682 transitions. [2022-11-03 02:03:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:03:28,857 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 [2022-11-03 02:03:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:28,860 INFO L225 Difference]: With dead ends: 2108 [2022-11-03 02:03:28,860 INFO L226 Difference]: Without dead ends: 2055 [2022-11-03 02:03:28,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:03:28,861 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 147 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:28,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 35 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 02:03:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2022-11-03 02:03:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1941. [2022-11-03 02:03:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1931 states have (on average 2.2677369238736405) internal successors, (4379), 1940 states have internal predecessors, (4379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4379 transitions. [2022-11-03 02:03:28,886 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4379 transitions. Word has length 21 [2022-11-03 02:03:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:28,886 INFO L495 AbstractCegarLoop]: Abstraction has 1941 states and 4379 transitions. [2022-11-03 02:03:28,886 INFO L496 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) [2022-11-03 02:03:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4379 transitions. [2022-11-03 02:03:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:03:28,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:28,887 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:28,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-11-03 02:03:28,887 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:03:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 828299172, now seen corresponding path program 12 times [2022-11-03 02:03:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:28,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596942127] [2022-11-03 02:03:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:32,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:32,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596942127] [2022-11-03 02:03:32,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596942127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:03:32,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843346142] [2022-11-03 02:03:32,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:03:32,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:03:32,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:03:32,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:03:32,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:03:32,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:03:32,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:03:32,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-03 02:03:32,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:03:32,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:32,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:32,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:32,901 INFO L390 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 67 [2022-11-03 02:03:32,920 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 81 [2022-11-03 02:03:32,933 INFO L390 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 [2022-11-03 02:03:33,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:33,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:33,885 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-03 02:03:33,886 INFO L390 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 4 case distinctions, treesize of input 42 treesize of output 52 [2022-11-03 02:03:33,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:03:33,902 INFO L390 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 106 treesize of output 64 [2022-11-03 02:03:33,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:33,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:33,916 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 02:03:33,951 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:03:33,951 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:03:33,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 02:03:33,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:34,012 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-03 02:03:34,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 40 [2022-11-03 02:03:34,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:34,204 INFO L390 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 0 case distinctions, treesize of input 34 treesize of output 34 [2022-11-03 02:03:34,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:34,210 INFO L390 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 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 02:03:34,256 INFO L390 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 49 treesize of output 37 [2022-11-03 02:03:34,372 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:03:34,373 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-11-03 02:03:34,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:34,499 INFO L390 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 31 treesize of output 26 [2022-11-03 02:03:34,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-03 02:03:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:34,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:03:36,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) is different from false [2022-11-03 02:03:38,410 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (forall ((v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (or (not (= (select (select (let ((.cse0 (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (or (forall ((v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (store .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (forall ((v_ArrVal_6399 (Array Int Int))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6399) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)))))) is different from false [2022-11-03 02:03:38,475 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| 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_6395)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (or (not (= (select (select (let ((.cse0 (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (forall ((|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (or (forall ((v_ArrVal_6399 (Array Int Int)) (v_ArrVal_6396 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_6396)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6399) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse3 (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_6395)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (store .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))))) is different from false [2022-11-03 02:03:38,588 INFO L356 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2022-11-03 02:03:38,588 INFO L390 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 2 case distinctions, treesize of input 32 treesize of output 49 [2022-11-03 02:03:38,600 INFO L390 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 60 treesize of output 48 [2022-11-03 02:03:38,609 INFO L390 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 17 treesize of output 13 [2022-11-03 02:03:38,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (select .cse6 .cse1))) (and (or (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse0 (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_6395)) .cse3 v_ArrVal_6400))) (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse3))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse4 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store .cse6 .cse1 v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (let ((.cse8 (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_6395)) .cse3 v_ArrVal_6400))) (or (not (= (select (select (let ((.cse7 (store .cse8 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse8 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse3))))))) is different from false [2022-11-03 02:03:38,809 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse1 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse3 (select .cse4 .cse1))) (and (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base| (store .cse4 .cse1 v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (or (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse5 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= |c_pusherThread1of1ForFork0_~q~0#1.base| .cse3))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (or (= (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) .cse3) (not (= (select (select (let ((.cse8 (store .cse7 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse7 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3)))) (store .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))))))) is different from false [2022-11-03 02:03:38,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse3 (select .cse6 .cse1))) (and (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| 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_6395)) .cse3 v_ArrVal_6400))) (or (not (= (select (select (let ((.cse0 (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3)))) (store .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= .cse3 (select (select .cse2 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse4 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base| (store .cse6 .cse1 v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse4 |c_pusherThread1of1ForFork0_#in~q_#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (or (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse7 (let ((.cse8 (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_6395)) .cse3 v_ArrVal_6400))) (store .cse8 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse8 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse7 |c_pusherThread1of1ForFork0_#in~q_#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= .cse3 |c_pusherThread1of1ForFork0_#in~q_#1.base|)))))) is different from false [2022-11-03 02:03:38,900 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select .cse4 .cse1))) (and (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| 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_6395)) .cse2 v_ArrVal_6400))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1) .cse2) (not (= (select (select (store .cse0 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse0 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse2)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse4 .cse1 v_ArrVal_6395)) .cse2 v_ArrVal_6400))) (store .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse2))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6395)) .cse2 v_ArrVal_6400))) (store .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse2))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))))) is different from false [2022-11-03 02:03:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:03:38,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843346142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:03:38,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [155938468] [2022-11-03 02:03:38,913 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:03:38,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:03:38,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 38 [2022-11-03 02:03:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145764460] [2022-11-03 02:03:38,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:03:38,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 02:03:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:38,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 02:03:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=863, Unknown=28, NotChecked=476, Total=1560 [2022-11-03 02:03:38,918 INFO L87 Difference]: Start difference. First operand 1941 states and 4379 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:39,144 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse5 .cse2))) (and (not (= .cse0 0)) (not (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| 0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (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_6395)) .cse3 v_ArrVal_6400))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse2) .cse3) (not (= (select (select (store .cse1 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse1 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int) (|ULTIMATE.start_main_~#p~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))) (and (not (= .cse4 0)) (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse4 (select v_arrayElimArr_2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= .cse5 (store (store (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#p~0#1.base| v_DerPreprocessor_3) .cse4 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base|) .cse2 .cse4) |c_ULTIMATE.start_main_~#q~1#1.offset| .cse4)) (not (= |ULTIMATE.start_main_~#p~0#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |ULTIMATE.start_main_~#p~0#1.base| .cse4)) (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse5 .cse2 v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse7 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse7 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))))) is different from false [2022-11-03 02:03:39,166 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse2 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse4 (select .cse7 .cse2)) (.cse0 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (not (= .cse0 0)) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| 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_6395)) .cse4 v_ArrVal_6400))) (or (not (= (select (select (let ((.cse1 (store .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse4)))) (store .cse1 |c_pusherThread1of1ForFork0_#in~q_#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= .cse4 (select (select .cse3 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2))))) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| 0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse5 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base| (store .cse7 .cse2 v_ArrVal_6395)) .cse4 v_ArrVal_6400))) (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse4))))) (store .cse5 |c_pusherThread1of1ForFork0_#in~q_#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (or (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse8 (let ((.cse9 (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_6395)) .cse4 v_ArrVal_6400))) (store .cse9 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse9 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse4))))) (store .cse8 |c_pusherThread1of1ForFork0_#in~q_#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse2 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= .cse4 |c_pusherThread1of1ForFork0_#in~q_#1.base|))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int) (|ULTIMATE.start_main_~#p~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))) (and (not (= .cse10 0)) (<= (+ 2 .cse10) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse10 (select v_arrayElimArr_2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (store (store (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#p~0#1.base| v_DerPreprocessor_3) .cse10 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse10) |c_ULTIMATE.start_main_~#q~1#1.offset| .cse10)) (not (= |ULTIMATE.start_main_~#p~0#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |ULTIMATE.start_main_~#p~0#1.base| .cse10)) (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (not (= |c_pusherThread1of1ForFork0_#in~q_#1.base| .cse0))))) is different from false [2022-11-03 02:03:39,220 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse1 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse3 (select .cse4 .cse1)) (.cse9 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base| (store .cse4 .cse1 v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| 0)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (or (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse5 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= |c_pusherThread1of1ForFork0_~q~0#1.base| .cse3))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (or (= (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1) .cse3) (not (= (select (select (let ((.cse8 (store .cse7 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse7 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3)))) (store .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))) (not (= .cse9 0)) (not (= .cse9 |c_pusherThread1of1ForFork0_~q~0#1.base|)) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int) (|ULTIMATE.start_main_~#p~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))) (and (not (= .cse10 0)) (<= (+ 2 .cse10) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse10 (select v_arrayElimArr_2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (store (store (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#p~0#1.base| v_DerPreprocessor_3) .cse10 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse10) |c_ULTIMATE.start_main_~#q~1#1.offset| .cse10)) (not (= |ULTIMATE.start_main_~#p~0#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |ULTIMATE.start_main_~#p~0#1.base| .cse10)) (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-11-03 02:03:39,286 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse7 .cse1))) (and (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| .cse0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| 0)) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (or (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse2 (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_6395)) .cse0 v_ArrVal_6400))) (store .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse3 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse0))))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse0))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse4)) (not (= .cse4 0)) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse5 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store .cse7 .cse1 v_ArrVal_6395)) .cse0 v_ArrVal_6400))) (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse0))))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int) (|ULTIMATE.start_main_~#p~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))) (and (not (= .cse8 0)) (<= (+ 2 .cse8) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse8 (select v_arrayElimArr_2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (store (store (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#p~0#1.base| v_DerPreprocessor_3) .cse8 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse8) |c_ULTIMATE.start_main_~#q~1#1.offset| .cse8)) (not (= |ULTIMATE.start_main_~#p~0#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |ULTIMATE.start_main_~#p~0#1.base| .cse8)) (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (let ((.cse10 (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_6395)) .cse0 v_ArrVal_6400))) (or (not (= (select (select (let ((.cse9 (store .cse10 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse10 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse0)))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse0))))))) is different from false [2022-11-03 02:03:39,350 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse7 .cse1))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| 0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (or (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse0 (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_6395)) .cse3 v_ArrVal_6400))) (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse3))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse4)) (not (= .cse4 0)) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse5 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store .cse7 .cse1 v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int) (|ULTIMATE.start_main_~#p~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))) (and (not (= .cse8 0)) (<= (+ 2 .cse8) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse8 (select v_arrayElimArr_2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (store (store (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#p~0#1.base| v_DerPreprocessor_3) .cse8 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse8) |c_ULTIMATE.start_main_~#q~1#1.offset| .cse8)) (not (= |ULTIMATE.start_main_~#p~0#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |ULTIMATE.start_main_~#p~0#1.base| .cse8)) (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (let ((.cse10 (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_6395)) .cse3 v_ArrVal_6400))) (or (not (= (select (select (let ((.cse9 (store .cse10 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse10 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3)))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse3))))))) is different from false [2022-11-03 02:03:39,402 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (select .cse6 .cse1))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (or (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse0 (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_6395)) .cse3 v_ArrVal_6400))) (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse3))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse4 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store .cse6 .cse1 v_ArrVal_6395)) .cse3 v_ArrVal_6400))) (store .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3))))) (store .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int) (|ULTIMATE.start_main_~#p~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))) (and (not (= .cse7 0)) (<= (+ 2 .cse7) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse7 (select v_arrayElimArr_2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (store (store (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#p~0#1.base| v_DerPreprocessor_3) .cse7 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse7) |c_ULTIMATE.start_main_~#q~1#1.offset| .cse7)) (not (= |ULTIMATE.start_main_~#p~0#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |ULTIMATE.start_main_~#p~0#1.base| .cse7)) (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (let ((.cse9 (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_6395)) .cse3 v_ArrVal_6400))) (or (not (= (select (select (let ((.cse8 (store .cse9 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse9 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) .cse3)))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse3))))))) is different from false [2022-11-03 02:03:39,495 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse0 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| 0)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| 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_6395)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (or (not (= (select (select (let ((.cse1 (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (not (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (forall ((|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (or (forall ((v_ArrVal_6399 (Array Int Int)) (v_ArrVal_6396 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_6396)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6399) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse4 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_6395)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (store .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse5 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (store .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int) (|ULTIMATE.start_main_~#p~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))) (and (not (= .cse6 0)) (<= (+ 2 .cse6) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse6 (select v_arrayElimArr_2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (store (store (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#p~0#1.base| v_DerPreprocessor_3) .cse6 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse6) |c_ULTIMATE.start_main_~#q~1#1.offset| .cse6)) (not (= |ULTIMATE.start_main_~#p~0#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |ULTIMATE.start_main_~#p~0#1.base| .cse6)) (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select .cse3 .cse0)) (let ((.cse7 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (or (not (= .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse7))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))))) is different from false [2022-11-03 02:03:39,524 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| 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_6395)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (or (not (= (select (select (let ((.cse1 (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (forall ((|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| Int)) (or (forall ((v_ArrVal_6399 (Array Int Int)) (v_ArrVal_6396 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_6396)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6399) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (forall ((v_ArrVal_6395 Int) (v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse3 (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_6395)) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (store .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int) (|ULTIMATE.start_main_~#p~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))) (and (not (= .cse5 0)) (<= (+ 2 .cse5) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse5 (select v_arrayElimArr_2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (store (store (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~#p~0#1.base| v_DerPreprocessor_3) .cse5 v_arrayElimArr_2) |c_ULTIMATE.start_main_~#q~1#1.base|) (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse5) |c_ULTIMATE.start_main_~#q~1#1.offset| .cse5)) (not (= |ULTIMATE.start_main_~#p~0#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |ULTIMATE.start_main_~#p~0#1.base| .cse5)) (= (select v_arrayElimArr_2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0)))) is different from false [2022-11-03 02:03:39,553 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (forall ((v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (or (not (= (select (select (let ((.cse0 (store .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse2 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (or (forall ((v_ArrVal_6400 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6400))) (store .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))) (forall ((v_ArrVal_6399 (Array Int Int))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_6399) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| 0)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (or (and (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) is different from false [2022-11-03 02:03:41,604 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (+ |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (forall ((|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| Int) (v_ArrVal_6404 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| (store (select |c_#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base|) (+ 16 |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset|) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) v_ArrVal_6404))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2022-11-03 02:03:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:44,569 INFO L93 Difference]: Finished difference Result 2561 states and 5750 transitions. [2022-11-03 02:03:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:03:44,570 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 02:03:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:44,573 INFO L225 Difference]: With dead ends: 2561 [2022-11-03 02:03:44,573 INFO L226 Difference]: Without dead ends: 2561 [2022-11-03 02:03:44,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=332, Invalid=1326, Unknown=50, NotChecked=1598, Total=3306 [2022-11-03 02:03:44,575 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 784 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3202 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:44,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 76 Invalid, 5811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2550 Invalid, 0 Unknown, 3202 Unchecked, 2.5s Time] [2022-11-03 02:03:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2022-11-03 02:03:44,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 1967. [2022-11-03 02:03:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1957 states have (on average 2.2667347981604498) internal successors, (4436), 1966 states have internal predecessors, (4436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 4436 transitions. [2022-11-03 02:03:44,611 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 4436 transitions. Word has length 22 [2022-11-03 02:03:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:44,611 INFO L495 AbstractCegarLoop]: Abstraction has 1967 states and 4436 transitions. [2022-11-03 02:03:44,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 4436 transitions. [2022-11-03 02:03:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:03:44,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:44,613 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:44,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:03:44,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-11-03 02:03:44,822 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:03:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1076524310, now seen corresponding path program 13 times [2022-11-03 02:03:44,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:44,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989923523] [2022-11-03 02:03:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:48,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989923523] [2022-11-03 02:03:48,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989923523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:03:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340977174] [2022-11-03 02:03:48,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:03:48,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:03:48,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:03:48,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:03:48,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:03:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:49,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 164 conjunts are in the unsatisfiable core [2022-11-03 02:03:49,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:03:49,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:49,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:49,428 INFO L390 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 [2022-11-03 02:03:49,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:49,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:49,442 INFO L390 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 [2022-11-03 02:03:49,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:49,452 INFO L390 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 [2022-11-03 02:03:49,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:49,466 INFO L390 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 [2022-11-03 02:03:49,496 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 02:03:49,497 INFO L390 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 129 treesize of output 117 [2022-11-03 02:03:49,509 INFO L390 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 [2022-11-03 02:03:49,533 INFO L390 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 20 treesize of output 18 [2022-11-03 02:03:49,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:49,541 INFO L390 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 62 treesize of output 49 [2022-11-03 02:03:50,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:50,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:50,737 INFO L356 Elim1Store]: treesize reduction 248, result has 14.8 percent of original size [2022-11-03 02:03:50,738 INFO L390 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 25 case distinctions, treesize of input 192 treesize of output 124 [2022-11-03 02:03:50,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:50,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:50,807 INFO L356 Elim1Store]: treesize reduction 106, result has 25.9 percent of original size [2022-11-03 02:03:50,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 85 [2022-11-03 02:03:51,027 INFO L356 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-11-03 02:03:51,028 INFO L390 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 140 treesize of output 107 [2022-11-03 02:03:51,036 INFO L390 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 [2022-11-03 02:03:51,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:03:51,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:51,059 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2022-11-03 02:03:51,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:51,182 INFO L390 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 50 treesize of output 23 [2022-11-03 02:03:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:51,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:03:51,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340977174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:03:51,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:03:51,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 26 [2022-11-03 02:03:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356036280] [2022-11-03 02:03:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:03:51,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:03:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:51,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:03:51,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:03:51,197 INFO L87 Difference]: Start difference. First operand 1967 states and 4436 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:52,788 INFO L93 Difference]: Finished difference Result 2052 states and 4587 transitions. [2022-11-03 02:03:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:03:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 02:03:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:52,791 INFO L225 Difference]: With dead ends: 2052 [2022-11-03 02:03:52,791 INFO L226 Difference]: Without dead ends: 2052 [2022-11-03 02:03:52,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2022-11-03 02:03:52,792 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 277 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:52,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 18 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-03 02:03:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2022-11-03 02:03:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1984. [2022-11-03 02:03:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1974 states have (on average 2.25177304964539) internal successors, (4445), 1983 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 4445 transitions. [2022-11-03 02:03:52,823 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 4445 transitions. Word has length 22 [2022-11-03 02:03:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:52,824 INFO L495 AbstractCegarLoop]: Abstraction has 1984 states and 4445 transitions. [2022-11-03 02:03:52,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 4445 transitions. [2022-11-03 02:03:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:03:52,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:52,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:52,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:03:53,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-11-03 02:03:53,050 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:03:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash 789424592, now seen corresponding path program 1 times [2022-11-03 02:03:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:53,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992642876] [2022-11-03 02:03:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:53,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:53,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992642876] [2022-11-03 02:03:53,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992642876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:03:53,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:03:53,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:03:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427274168] [2022-11-03 02:03:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:03:53,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:03:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:03:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:03:53,756 INFO L87 Difference]: Start difference. First operand 1984 states and 4445 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:03:55,367 INFO L93 Difference]: Finished difference Result 2317 states and 5107 transitions. [2022-11-03 02:03:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:03:55,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:03:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:03:55,370 INFO L225 Difference]: With dead ends: 2317 [2022-11-03 02:03:55,370 INFO L226 Difference]: Without dead ends: 2317 [2022-11-03 02:03:55,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:03:55,370 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 166 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:03:55,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 45 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 02:03:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2022-11-03 02:03:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2053. [2022-11-03 02:03:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2041 states have (on average 2.2297893189612936) internal successors, (4551), 2052 states have internal predecessors, (4551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 4551 transitions. [2022-11-03 02:03:55,400 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 4551 transitions. Word has length 23 [2022-11-03 02:03:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:03:55,400 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 4551 transitions. [2022-11-03 02:03:55,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:03:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 4551 transitions. [2022-11-03 02:03:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:03:55,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:03:55,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:03:55,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-11-03 02:03:55,401 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:03:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:03:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1424049119, now seen corresponding path program 1 times [2022-11-03 02:03:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:03:55,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477567948] [2022-11-03 02:03:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:03:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:03:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:03:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:03:57,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:03:57,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477567948] [2022-11-03 02:03:57,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477567948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:03:57,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:03:57,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-03 02:03:57,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551960866] [2022-11-03 02:03:57,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:03:57,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:03:57,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:03:57,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:03:57,432 INFO L87 Difference]: Start difference. First operand 2053 states and 4551 transitions. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:05,827 INFO L93 Difference]: Finished difference Result 4011 states and 8907 transitions. [2022-11-03 02:04:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-03 02:04:05,828 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:04:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:05,832 INFO L225 Difference]: With dead ends: 4011 [2022-11-03 02:04:05,832 INFO L226 Difference]: Without dead ends: 4011 [2022-11-03 02:04:05,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=350, Invalid=1906, Unknown=0, NotChecked=0, Total=2256 [2022-11-03 02:04:05,833 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 765 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 5063 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 5063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:05,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 53 Invalid, 5163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 5063 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-03 02:04:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2022-11-03 02:04:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 2244. [2022-11-03 02:04:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 2233 states have (on average 2.237348858038513) internal successors, (4996), 2243 states have internal predecessors, (4996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 4996 transitions. [2022-11-03 02:04:05,878 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 4996 transitions. Word has length 23 [2022-11-03 02:04:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:05,879 INFO L495 AbstractCegarLoop]: Abstraction has 2244 states and 4996 transitions. [2022-11-03 02:04:05,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 4996 transitions. [2022-11-03 02:04:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:04:05,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:05,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:05,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-11-03 02:04:05,880 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:04:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1551535948, now seen corresponding path program 2 times [2022-11-03 02:04:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:05,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522521846] [2022-11-03 02:04:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:06,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:06,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522521846] [2022-11-03 02:04:06,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522521846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:06,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696567883] [2022-11-03 02:04:06,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:04:06,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:06,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:06,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:06,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:04:07,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:04:07,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:04:07,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-03 02:04:07,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:07,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,363 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:04:07,364 INFO L390 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 [2022-11-03 02:04:07,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,385 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:04:07,386 INFO L390 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 [2022-11-03 02:04:07,394 INFO L390 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 [2022-11-03 02:04:07,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,416 INFO L390 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 [2022-11-03 02:04:07,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,438 INFO L390 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 [2022-11-03 02:04:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:07,813 INFO L390 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 [2022-11-03 02:04:07,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:07,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:07,824 INFO L390 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 [2022-11-03 02:04:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:08,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:08,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:08,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-11-03 02:04:08,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:08,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 02:04:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:08,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696567883] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:04:08,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [205975830] [2022-11-03 02:04:08,214 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:04:08,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:04:08,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-11-03 02:04:08,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074573773] [2022-11-03 02:04:08,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:08,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:04:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:04:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:04:08,218 INFO L87 Difference]: Start difference. First operand 2244 states and 4996 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:09,711 INFO L93 Difference]: Finished difference Result 2323 states and 5157 transitions. [2022-11-03 02:04:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:04:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:04:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:09,714 INFO L225 Difference]: With dead ends: 2323 [2022-11-03 02:04:09,714 INFO L226 Difference]: Without dead ends: 2323 [2022-11-03 02:04:09,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:04:09,715 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 179 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:09,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 43 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 02:04:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2022-11-03 02:04:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2251. [2022-11-03 02:04:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2240 states have (on average 2.2370535714285715) internal successors, (5011), 2250 states have internal predecessors, (5011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 5011 transitions. [2022-11-03 02:04:09,737 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 5011 transitions. Word has length 23 [2022-11-03 02:04:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:09,737 INFO L495 AbstractCegarLoop]: Abstraction has 2251 states and 5011 transitions. [2022-11-03 02:04:09,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 5011 transitions. [2022-11-03 02:04:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:04:09,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:09,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:09,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:09,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:09,939 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:04:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash -962474814, now seen corresponding path program 3 times [2022-11-03 02:04:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:09,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471958258] [2022-11-03 02:04:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:10,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471958258] [2022-11-03 02:04:10,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471958258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207058017] [2022-11-03 02:04:10,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:04:10,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:10,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:10,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:10,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:04:11,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:04:11,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:04:11,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-03 02:04:11,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:11,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:11,350 INFO L356 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-11-03 02:04:11,350 INFO L390 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 110 [2022-11-03 02:04:11,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:11,432 INFO L356 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-11-03 02:04:11,433 INFO L390 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 110 [2022-11-03 02:04:11,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:11,456 INFO L390 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 [2022-11-03 02:04:11,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:11,477 INFO L390 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 [2022-11-03 02:04:11,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:11,501 INFO L390 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 [2022-11-03 02:04:11,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:11,523 INFO L390 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 [2022-11-03 02:04:11,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:11,542 INFO L390 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 [2022-11-03 02:04:11,650 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 02:04:11,650 INFO L390 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 3 case distinctions, treesize of input 80 treesize of output 47 [2022-11-03 02:04:11,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:11,659 INFO L390 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 [2022-11-03 02:04:12,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:12,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:12,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:12,428 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-03 02:04:12,432 INFO L390 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 18 treesize of output 10 [2022-11-03 02:04:12,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:12,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:12,443 INFO L390 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 [2022-11-03 02:04:12,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:12,622 INFO L390 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 [2022-11-03 02:04:12,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:12,629 INFO L390 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 [2022-11-03 02:04:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:12,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:12,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (forall ((v_ArrVal_7202 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| v_ArrVal_7202) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324|))) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324|) (forall ((v_ArrVal_7201 (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_324| v_ArrVal_7201) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0))))))) is different from false [2022-11-03 02:04:12,715 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (forall ((v_ArrVal_7202 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| 1)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| v_ArrVal_7202) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))) (forall ((v_ArrVal_7201 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| 1)) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| v_ArrVal_7201) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0)))))) is different from false [2022-11-03 02:04:12,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:12,782 INFO L390 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 61 treesize of output 60 [2022-11-03 02:04:12,791 INFO L390 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 40 [2022-11-03 02:04:12,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:12,805 INFO L390 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 64 treesize of output 63 [2022-11-03 02:04:12,811 INFO L390 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 47 treesize of output 43 [2022-11-03 02:04:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:04:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207058017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:04:13,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [109507483] [2022-11-03 02:04:13,330 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:04:13,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:04:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-11-03 02:04:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102507959] [2022-11-03 02:04:13,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 02:04:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 02:04:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=593, Unknown=10, NotChecked=102, Total=812 [2022-11-03 02:04:13,332 INFO L87 Difference]: Start difference. First operand 2251 states and 5011 transitions. Second operand has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:14,099 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) (.cse0 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0)) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (forall ((v_ArrVal_7202 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| 1)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| v_ArrVal_7202) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))) (forall ((v_ArrVal_7201 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| 1)) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| v_ArrVal_7201) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse0)))) is different from false [2022-11-03 02:04:14,125 WARN L833 $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_#t~mem4#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0)) (forall ((v_ArrVal_7202 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| 1)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| v_ArrVal_7202) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|))) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (forall ((v_ArrVal_7201 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| 1)) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| v_ArrVal_7201) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0)))) is different from false [2022-11-03 02:04:14,203 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (forall ((v_ArrVal_7202 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| v_ArrVal_7202) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324|))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_324|) (forall ((v_ArrVal_7201 (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_324| v_ArrVal_7201) |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0))))) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse0)))) is different from false [2022-11-03 02:04:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:14,810 INFO L93 Difference]: Finished difference Result 2338 states and 5198 transitions. [2022-11-03 02:04:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:04:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:04:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:14,814 INFO L225 Difference]: With dead ends: 2338 [2022-11-03 02:04:14,814 INFO L226 Difference]: Without dead ends: 2338 [2022-11-03 02:04:14,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=773, Unknown=13, NotChecked=310, Total=1260 [2022-11-03 02:04:14,814 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1057 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:14,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 75 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1104 Invalid, 0 Unknown, 1057 Unchecked, 1.1s Time] [2022-11-03 02:04:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2022-11-03 02:04:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2267. [2022-11-03 02:04:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 2256 states have (on average 2.2375886524822697) internal successors, (5048), 2266 states have internal predecessors, (5048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 5048 transitions. [2022-11-03 02:04:14,841 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 5048 transitions. Word has length 23 [2022-11-03 02:04:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:14,842 INFO L495 AbstractCegarLoop]: Abstraction has 2267 states and 5048 transitions. [2022-11-03 02:04:14,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 5048 transitions. [2022-11-03 02:04:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:04:14,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:14,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:14,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:15,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:15,044 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:04:15,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash 311961862, now seen corresponding path program 4 times [2022-11-03 02:04:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:15,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893247957] [2022-11-03 02:04:15,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:15,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:15,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893247957] [2022-11-03 02:04:15,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893247957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:04:15,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:04:15,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:04:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394571427] [2022-11-03 02:04:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:04:15,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:04:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:04:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:04:15,797 INFO L87 Difference]: Start difference. First operand 2267 states and 5048 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) [2022-11-03 02:04:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:17,704 INFO L93 Difference]: Finished difference Result 2576 states and 5657 transitions. [2022-11-03 02:04:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:04:17,705 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 [2022-11-03 02:04:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:17,708 INFO L225 Difference]: With dead ends: 2576 [2022-11-03 02:04:17,708 INFO L226 Difference]: Without dead ends: 2576 [2022-11-03 02:04:17,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:04:17,708 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 203 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:17,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 49 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 02:04:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2022-11-03 02:04:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2327. [2022-11-03 02:04:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2315 states have (on average 2.2323974082073432) internal successors, (5168), 2326 states have internal predecessors, (5168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 5168 transitions. [2022-11-03 02:04:17,736 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 5168 transitions. Word has length 23 [2022-11-03 02:04:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:17,737 INFO L495 AbstractCegarLoop]: Abstraction has 2327 states and 5168 transitions. [2022-11-03 02:04:17,737 INFO L496 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) [2022-11-03 02:04:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 5168 transitions. [2022-11-03 02:04:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:04:17,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:17,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:17,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-11-03 02:04:17,738 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:04:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1224931113, now seen corresponding path program 2 times [2022-11-03 02:04:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:17,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675931880] [2022-11-03 02:04:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:19,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:19,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675931880] [2022-11-03 02:04:19,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675931880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:04:19,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:04:19,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 02:04:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694657366] [2022-11-03 02:04:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:04:19,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:04:19,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:04:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:04:19,020 INFO L87 Difference]: Start difference. First operand 2327 states and 5168 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) [2022-11-03 02:04:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:21,389 INFO L93 Difference]: Finished difference Result 2358 states and 5238 transitions. [2022-11-03 02:04:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:04:21,390 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 [2022-11-03 02:04:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:21,392 INFO L225 Difference]: With dead ends: 2358 [2022-11-03 02:04:21,392 INFO L226 Difference]: Without dead ends: 2355 [2022-11-03 02:04:21,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:04:21,393 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 130 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:21,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 47 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 02:04:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2022-11-03 02:04:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2306. [2022-11-03 02:04:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2295 states have (on average 2.2405228758169935) internal successors, (5142), 2305 states have internal predecessors, (5142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 5142 transitions. [2022-11-03 02:04:21,428 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 5142 transitions. Word has length 23 [2022-11-03 02:04:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:21,429 INFO L495 AbstractCegarLoop]: Abstraction has 2306 states and 5142 transitions. [2022-11-03 02:04:21,429 INFO L496 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) [2022-11-03 02:04:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 5142 transitions. [2022-11-03 02:04:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:04:21,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:21,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:21,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-11-03 02:04:21,431 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:04:21,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1118221828, now seen corresponding path program 5 times [2022-11-03 02:04:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:21,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415083481] [2022-11-03 02:04:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:22,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:22,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415083481] [2022-11-03 02:04:22,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415083481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:22,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824841525] [2022-11-03 02:04:22,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:04:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:22,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:22,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:22,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:04:23,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:04:23,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:04:23,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-03 02:04:23,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:23,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,616 INFO L390 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 [2022-11-03 02:04:23,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,621 INFO L390 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 [2022-11-03 02:04:23,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,639 INFO L390 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 [2022-11-03 02:04:23,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,652 INFO L390 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 [2022-11-03 02:04:23,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,664 INFO L390 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 [2022-11-03 02:04:23,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,674 INFO L390 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 [2022-11-03 02:04:23,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:23,695 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:04:23,696 INFO L390 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 61 treesize of output 57 [2022-11-03 02:04:23,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2022-11-03 02:04:24,334 INFO L390 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 [2022-11-03 02:04:24,521 INFO L356 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-11-03 02:04:24,522 INFO L390 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 [2022-11-03 02:04:24,539 INFO L390 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 [2022-11-03 02:04:24,622 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:04:24,622 INFO L390 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 [2022-11-03 02:04:24,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,794 INFO L390 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 [2022-11-03 02:04:24,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:24,871 INFO L390 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 [2022-11-03 02:04:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:24,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:24,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7578 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326|))) is different from false [2022-11-03 02:04:24,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7578 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) is different from false [2022-11-03 02:04:24,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7578 (Array Int Int)) (v_ArrVal_7577 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7577) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) is different from false [2022-11-03 02:04:24,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7576 (Array Int Int)) (v_ArrVal_7578 (Array Int Int)) (v_ArrVal_7577 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_7576) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7577) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) is different from false [2022-11-03 02:04:24,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7576 (Array Int Int)) (v_ArrVal_7578 (Array Int Int)) (v_ArrVal_7577 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_ArrVal_7576) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_7577) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) is different from false [2022-11-03 02:04:25,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7576 (Array Int Int)) (v_ArrVal_7578 (Array Int Int)) (v_ArrVal_7577 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| 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_7576) .cse0 v_ArrVal_7577))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) is different from false [2022-11-03 02:04:25,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7576 (Array Int Int)) (v_ArrVal_7578 (Array Int Int)) (v_ArrVal_7577 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| 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_7576) .cse0 v_ArrVal_7577))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) is different from false [2022-11-03 02:04:25,084 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7576 (Array Int Int)) (v_ArrVal_7578 (Array Int Int)) (v_ArrVal_7577 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| 1)) (not (= (select (select (store (let ((.cse1 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (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_7576) .cse0 v_ArrVal_7577))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2022-11-03 02:04:25,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7576 (Array Int Int)) (v_ArrVal_7578 (Array Int Int)) (v_ArrVal_7577 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| 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_7576) .cse0 v_ArrVal_7577))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) is different from false [2022-11-03 02:04:25,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7576 (Array Int Int)) (v_ArrVal_7578 (Array Int Int)) (v_ArrVal_7577 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (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) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) v_ArrVal_7576) .cse0 v_ArrVal_7577))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) is different from false [2022-11-03 02:04:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:04:25,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824841525] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:04:25,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882386490] [2022-11-03 02:04:25,123 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:04:25,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:04:25,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2022-11-03 02:04:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980479203] [2022-11-03 02:04:25,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:25,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:04:25,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:25,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:04:25,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=615, Unknown=10, NotChecked=590, Total=1332 [2022-11-03 02:04:25,127 INFO L87 Difference]: Start difference. First operand 2306 states and 5142 transitions. Second operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 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) [2022-11-03 02:04:30,517 WARN L833 $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 .cse2 4))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse0) (< .cse1 |c_#StackHeapBarrier|) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (forall ((v_ArrVal_7578 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) (= .cse1 .cse0) (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 [2022-11-03 02:04:30,738 WARN L833 $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.offset| 0) (< .cse0 |c_#StackHeapBarrier|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_7578 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |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_326| 1)))) (= .cse0 (select .cse1 4))))) is different from false [2022-11-03 02:04:31,581 WARN L833 $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.offset| 0) (<= (+ .cse0 2) |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (forall ((v_ArrVal_7578 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326| v_ArrVal_7578) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_326|))) (= .cse0 (select .cse1 4))))) is different from false [2022-11-03 02:04:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:33,807 INFO L93 Difference]: Finished difference Result 3837 states and 8518 transitions. [2022-11-03 02:04:33,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-03 02:04:33,808 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 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 [2022-11-03 02:04:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:33,813 INFO L225 Difference]: With dead ends: 3837 [2022-11-03 02:04:33,814 INFO L226 Difference]: Without dead ends: 3837 [2022-11-03 02:04:33,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=742, Invalid=3079, Unknown=13, NotChecked=1716, Total=5550 [2022-11-03 02:04:33,815 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 746 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 3407 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 6712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3257 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:33,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 58 Invalid, 6712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3407 Invalid, 0 Unknown, 3257 Unchecked, 3.6s Time] [2022-11-03 02:04:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2022-11-03 02:04:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 2637. [2022-11-03 02:04:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2626 states have (on average 2.2604722010662606) internal successors, (5936), 2636 states have internal predecessors, (5936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 5936 transitions. [2022-11-03 02:04:33,872 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 5936 transitions. Word has length 23 [2022-11-03 02:04:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:33,872 INFO L495 AbstractCegarLoop]: Abstraction has 2637 states and 5936 transitions. [2022-11-03 02:04:33,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 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) [2022-11-03 02:04:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 5936 transitions. [2022-11-03 02:04:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:04:33,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:33,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:33,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:34,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:34,098 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:04:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1166858038, now seen corresponding path program 6 times [2022-11-03 02:04:34,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:34,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483298657] [2022-11-03 02:04:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:36,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483298657] [2022-11-03 02:04:36,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483298657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981464255] [2022-11-03 02:04:36,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:04:36,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:36,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:36,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:04:36,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:04:36,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:04:36,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-03 02:04:36,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:36,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:36,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:36,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:36,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:36,763 INFO L390 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 [2022-11-03 02:04:36,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:36,772 INFO L390 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 [2022-11-03 02:04:36,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:36,777 INFO L390 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 [2022-11-03 02:04:37,380 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-03 02:04:37,381 INFO L390 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 [2022-11-03 02:04:37,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:37,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:37,404 INFO L390 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 [2022-11-03 02:04:37,442 INFO L390 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 62 treesize of output 54 [2022-11-03 02:04:37,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:37,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:37,716 INFO L356 Elim1Store]: treesize reduction 86, result has 16.5 percent of original size [2022-11-03 02:04:37,716 INFO L390 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 [2022-11-03 02:04:37,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:37,913 INFO L390 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 [2022-11-03 02:04:38,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:38,475 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:04:38,475 INFO L390 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 [2022-11-03 02:04:38,487 INFO L390 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 [2022-11-03 02:04:38,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:38,556 INFO L390 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 [2022-11-03 02:04:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:38,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:38,571 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2022-11-03 02:04:38,592 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2022-11-03 02:04:38,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:38,870 INFO L390 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 38 [2022-11-03 02:04:40,574 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_7765))) (or (not (= (select (select (store .cse5 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |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 .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (let ((.cse6 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= .cse6 (select (select .cse5 .cse6) (+ v_arrayElimCell_118 12)))))))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_7765))) (or (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |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 .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2))) (not (let ((.cse3 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= .cse3 (select (select .cse1 .cse3) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1))))))) is different from false [2022-11-03 02:04:40,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse6 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| (select .cse5 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse8 (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= .cse8 (select (select .cse7 .cse8) (+ v_arrayElimCell_118 12)))))))))) (and (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse3 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select .cse5 .cse3) v_ArrVal_7765))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse2 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= (select (select .cse0 .cse2) .cse3) .cse2))))))))) (or .cse6 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (or .cse6 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))))) is different from false [2022-11-03 02:04:40,709 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4))) (let ((.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse7 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| (select .cse6 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (let ((.cse9 (select (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse8 .cse9) (+ v_arrayElimCell_118 12)) .cse9))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse8 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) .cse5))))))) (and (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse2 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select .cse6 .cse2) v_ArrVal_7765))) (or (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse0 .cse1) .cse2) .cse1))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |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|) .cse4) .cse5)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse7) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7)))))) is different from false [2022-11-03 02:04:40,843 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4))) (let ((.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse7 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| (select .cse6 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (let ((.cse9 (select (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse8 .cse9) (+ v_arrayElimCell_118 12)) .cse9))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse8 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) .cse5))))))) (and (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse2 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select .cse6 .cse2) v_ArrVal_7765))) (or (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse0 .cse1) .cse2) .cse1))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |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|) .cse4) .cse5)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7) (or .cse7 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|))))))) is different from false [2022-11-03 02:04:40,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4)) (.cse3 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse3) v_ArrVal_7765))) (let ((.cse1 (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#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_328| v_ArrVal_7768) |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_328| 1)))) is different from false [2022-11-03 02:04:41,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 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 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse3) v_ArrVal_7765))) (let ((.cse1 (select (select .cse2 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse4))) (or (not (= .cse0 .cse1)) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select .cse2 .cse1) .cse3) .cse1)) (not (= 0 (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-11-03 02:04:41,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse4)) (.cse3 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) v_ArrVal_7765))) (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_328| v_ArrVal_7768) |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_328| 1)) (not (= .cse1 .cse2)) (not (= .cse1 (select (select .cse0 .cse1) .cse3))))))))) is different from false [2022-11-03 02:04:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:04:41,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981464255] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:04:41,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [984287804] [2022-11-03 02:04:41,031 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:04:41,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:04:41,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 47 [2022-11-03 02:04:41,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397683490] [2022-11-03 02:04:41,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:41,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:04:41,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:41,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:04:41,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1370, Unknown=9, NotChecked=756, Total=2352 [2022-11-03 02:04:41,033 INFO L87 Difference]: Start difference. First operand 2637 states and 5936 transitions. Second operand has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 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) [2022-11-03 02:04:41,338 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.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 .cse9 .cse7)) (.cse2 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse8 .cse7))) (and (not (= .cse0 0)) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse1)) (< .cse0 |c_#StackHeapBarrier|) (= .cse2 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) (+ 12 .cse3)) 4) (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (let ((.cse6 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse4 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse1) .cse6) v_ArrVal_7765))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse7))) (or (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |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_328| 1)) (not (= .cse5 .cse1)) (not (= .cse5 (select (select .cse4 .cse5) .cse6)))))))) (<= .cse2 .cse3) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-11-03 02:04:41,343 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse9 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse4 (select .cse10 .cse9)) (.cse5 (select .cse1 .cse9))) (and (= .cse0 0) (not (= (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse2 0)) (= .cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (< .cse2 |c_#StackHeapBarrier|) (<= .cse0 .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse5) (+ .cse4 12)) 4) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (let ((.cse8 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse7 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse5) .cse8) v_ArrVal_7765))) (let ((.cse6 (select (select .cse7 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse9))) (or (not (= .cse5 .cse6)) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select .cse7 .cse6) .cse8) .cse6)) (not (= 0 (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (not (= .cse5 |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-11-03 02:04:41,349 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse9 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse10 .cse9)) (.cse5 (select .cse4 .cse9))) (and (not (= .cse0 0)) (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= .cse2 0) (<= .cse2 .cse3) (not (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= |c_pusherThread1of1ForFork0_~q~0#1.base| .cse5)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse5) (+ .cse3 12)) 4) (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse8 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse7 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse5) .cse8) v_ArrVal_7765))) (let ((.cse6 (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9))) (or (not (= .cse5 .cse6)) (not (= (select (select .cse7 .cse6) .cse8) .cse6)) (not (= (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |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_328| 1)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-11-03 02:04:41,356 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse11 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (select .cse5 .cse11))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse10 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse12 (select |c_#memory_$Pointer$.base| .cse0)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse14 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| (select .cse12 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (let ((.cse16 (select (select .cse15 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10))) (= (select (select .cse15 .cse16) (+ v_arrayElimCell_118 12)) .cse16))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse15 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) .cse0)))))) (.cse6 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse13 (select .cse3 .cse11))) (and (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| .cse0) .cse1 (not (= .cse2 0)) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= .cse2 (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (< .cse2 |c_#StackHeapBarrier|) (not (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) .cse6 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse9 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse7 (store |c_#memory_$Pointer$.base| (select .cse12 .cse9) v_ArrVal_7765))) (or (not (let ((.cse8 (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10))) (= (select (select .cse7 .cse8) .cse9) .cse8))) (not (= (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) .cse0)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)))) (<= |c_ULTIMATE.start_main_~#q~1#1.offset| .cse13) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse0)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (or .cse1 .cse14) (or .cse14 .cse6) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (+ 12 .cse13)) 4) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-11-03 02:04:41,377 WARN L833 $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))) (let ((.cse11 (select .cse4 .cse10))) (let ((.cse9 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse12 (select |c_#memory_$Pointer$.base| .cse11)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse13 (select .cse2 .cse10)) (.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse14 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| (select .cse12 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (let ((.cse16 (select (select .cse15 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9))) (= (select (select .cse15 .cse16) (+ v_arrayElimCell_118 12)) .cse16))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse15 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10) .cse11)))))) (.cse5 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and .cse0 (not (= .cse1 0)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0) (= .cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) (not (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) .cse5 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse8 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse6 (store |c_#memory_$Pointer$.base| (select .cse12 .cse8) v_ArrVal_7765))) (or (not (let ((.cse7 (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse9))) (= (select (select .cse6 .cse7) .cse8) .cse7))) (not (= (select (select (store .cse6 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse10) .cse11)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)))) (<= |c_ULTIMATE.start_main_~#q~1#1.offset| .cse13) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse11)) (= (select (select |c_#memory_$Pointer$.offset| .cse11) (+ 12 .cse13)) 4) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (or .cse0 .cse14) (or .cse14 .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-11-03 02:04:41,385 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))) (let ((.cse7 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse11 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| (select .cse10 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (let ((.cse13 (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7))) (= (select (select .cse12 .cse13) (+ v_arrayElimCell_118 12)) .cse13))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse12 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) .cse9)))))) (.cse3 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and .cse0 (not (= .cse1 0)) (= .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) .cse3 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse6 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse4 (store |c_#memory_$Pointer$.base| (select .cse10 .cse6) v_ArrVal_7765))) (or (not (let ((.cse5 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7))) (= (select (select .cse4 .cse5) .cse6) .cse5))) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |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|) .cse8) .cse9)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)))) (or .cse0 .cse11) (or .cse11 .cse3) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-11-03 02:04:41,404 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse10 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse11 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| (select .cse9 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (let ((.cse13 (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse12 .cse13) (+ v_arrayElimCell_118 12)) .cse13))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse12 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) .cse8)))))) (.cse0 (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (not (= .cse0 0)) .cse1 (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= .cse0 (select .cse2 .cse3)) (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse6 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse4 (store |c_#memory_$Pointer$.base| (select .cse9 .cse6) v_ArrVal_7765))) (or (not (let ((.cse5 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse4 .cse5) .cse6) .cse5))) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |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|) .cse7) .cse8)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (or .cse10 .cse11) (or .cse1 .cse11) (< .cse0 |c_#StackHeapBarrier|)))))) is different from false [2022-11-03 02:04:41,424 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse9 (select .cse14 .cse8))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse4 (select .cse11 .cse8)) (.cse12 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse13 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| (select .cse10 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (let ((.cse16 (select (select .cse15 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse15 .cse16) (+ v_arrayElimCell_118 12)) .cse16))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse15 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) .cse9)))))) (.cse0 (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.offset|))) (and (not (= .cse0 0)) .cse1 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= .cse0 (select .cse2 .cse3)) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| .cse4) (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse7 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse5 (store |c_#memory_$Pointer$.base| (select .cse10 .cse7) v_ArrVal_7765))) (or (not (let ((.cse6 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse5 .cse6) .cse7) .cse6))) (not (= (select (select (store .cse5 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) .cse9)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= (select .cse11 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0) .cse12 (= |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| .cse9)) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) (+ 12 .cse4)) 4) (or .cse12 .cse13) (or .cse1 .cse13) (< .cse0 |c_#StackHeapBarrier|) (not (= (select .cse14 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))))) is different from false [2022-11-03 02:04:41,477 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse4 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse0 (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse10 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| (select .cse9 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse12 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse13 (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= .cse13 (select (select .cse12 .cse13) (+ v_arrayElimCell_118 12))))))))) (.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (not (= .cse0 0)) .cse1 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= .cse0 (select .cse2 .cse3)) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse4 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse8 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse5 (store |c_#memory_$Pointer$.base| (select .cse9 .cse8) v_ArrVal_7765))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (not (= (select (select (store .cse5 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse7 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse5 .cse7) .cse8) .cse7))))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (or .cse10 .cse4) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select .cse11 .cse6)) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (< .cse0 |c_#StackHeapBarrier|) (not (= (select .cse11 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (or .cse10 .cse1)))) is different from false [2022-11-03 02:04:41,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse9 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse4 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse0 (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse10 (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int) (v_arrayElimCell_118 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| (select .cse9 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12)) v_ArrVal_7765))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= (select (select (store .cse11 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse12 (select (select .cse11 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= .cse12 (select (select .cse11 .cse12) (+ v_arrayElimCell_118 12))))))))) (.cse1 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|))) (and (not (= .cse0 0)) .cse1 (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= .cse0 (select .cse2 .cse3)) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4 (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (forall ((|pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (forall ((v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (let ((.cse8 (+ |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 12))) (let ((.cse5 (store |c_#memory_$Pointer$.base| (select .cse9 .cse8) v_ArrVal_7765))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6))) (not (= (select (select (store .cse5 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse7 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse5 .cse7) .cse8) .cse7))))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (or .cse10 .cse4) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6)) (< .cse0 |c_#StackHeapBarrier|) (or .cse10 .cse1)))) is different from false [2022-11-03 02:04:44,930 WARN L833 $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))) (.cse0 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (and (forall ((v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse0 0)) (< .cse0 |c_#StackHeapBarrier|) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse1 .cse0)))) is different from false [2022-11-03 02:04:45,183 WARN L833 $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))) (.cse0 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (<= (+ 2 .cse0) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)))) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (= .cse1 .cse0)))) is different from false [2022-11-03 02:04:45,228 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| 1)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|)) is different from false [2022-11-03 02:04:45,454 WARN L833 $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)) (not (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|)) (forall ((v_ArrVal_7768 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328|) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_328| v_ArrVal_7768) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)))))) is different from false [2022-11-03 02:04:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:51,678 INFO L93 Difference]: Finished difference Result 4825 states and 10997 transitions. [2022-11-03 02:04:51,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-03 02:04:51,679 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 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 [2022-11-03 02:04:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:51,684 INFO L225 Difference]: With dead ends: 4825 [2022-11-03 02:04:51,684 INFO L226 Difference]: Without dead ends: 4825 [2022-11-03 02:04:51,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=592, Invalid=3896, Unknown=26, NotChecked=3496, Total=8010 [2022-11-03 02:04:51,685 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1372 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 7333 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 21779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 7333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14437 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:51,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 94 Invalid, 21779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 7333 Invalid, 0 Unknown, 14437 Unchecked, 6.9s Time] [2022-11-03 02:04:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2022-11-03 02:04:51,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 2779. [2022-11-03 02:04:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2768 states have (on average 2.2778179190751446) internal successors, (6305), 2778 states have internal predecessors, (6305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 6305 transitions. [2022-11-03 02:04:51,726 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 6305 transitions. Word has length 23 [2022-11-03 02:04:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:51,727 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 6305 transitions. [2022-11-03 02:04:51,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 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) [2022-11-03 02:04:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 6305 transitions. [2022-11-03 02:04:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:04:51,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:51,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:51,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:51,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2022-11-03 02:04:51,929 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:04:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:51,930 INFO L85 PathProgramCache]: Analyzing trace with hash -967664764, now seen corresponding path program 7 times [2022-11-03 02:04:51,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:51,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450677469] [2022-11-03 02:04:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:53,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:53,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450677469] [2022-11-03 02:04:53,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450677469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:53,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282567861] [2022-11-03 02:04:53,104 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:04:53,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:53,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:53,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:53,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:04:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:53,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 139 conjunts are in the unsatisfiable core [2022-11-03 02:04:53,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:53,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:53,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:53,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:53,687 INFO L390 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 67 [2022-11-03 02:04:53,700 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 81 [2022-11-03 02:04:53,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:53,712 INFO L390 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 [2022-11-03 02:04:54,518 INFO L390 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 [2022-11-03 02:04:54,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:54,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:54,806 INFO L356 Elim1Store]: treesize reduction 34, result has 50.7 percent of original size [2022-11-03 02:04:54,807 INFO L390 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 8 case distinctions, treesize of input 50 treesize of output 72 [2022-11-03 02:04:54,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:54,820 INFO L390 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 96 treesize of output 70 [2022-11-03 02:04:54,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:54,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:54,830 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-11-03 02:04:54,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-03 02:04:54,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:54,941 INFO L356 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-11-03 02:04:54,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 59 [2022-11-03 02:04:55,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:55,012 INFO L356 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2022-11-03 02:04:55,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 30 [2022-11-03 02:04:55,078 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:04:55,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-11-03 02:04:55,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:55,564 INFO L356 Elim1Store]: treesize reduction 188, result has 14.9 percent of original size [2022-11-03 02:04:55,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 103 treesize of output 78 [2022-11-03 02:04:55,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:55,870 INFO L390 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 126 treesize of output 96 [2022-11-03 02:04:56,759 INFO L356 Elim1Store]: treesize reduction 68, result has 45.6 percent of original size [2022-11-03 02:04:56,759 INFO L390 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 123 treesize of output 154 [2022-11-03 02:04:57,844 INFO L390 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 23 treesize of output 15 [2022-11-03 02:04:57,863 INFO L390 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 33 treesize of output 21 [2022-11-03 02:04:57,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:57,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 120 [2022-11-03 02:04:58,000 INFO L390 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 [2022-11-03 02:04:58,051 INFO L390 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 [2022-11-03 02:04:58,118 INFO L390 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 22 treesize of output 14 [2022-11-03 02:04:58,135 INFO L390 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 25 treesize of output 17 [2022-11-03 02:04:58,177 INFO L390 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 26 treesize of output 18 [2022-11-03 02:04:58,702 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:58,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-11-03 02:04:58,770 INFO L390 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 38 treesize of output 26 [2022-11-03 02:05:23,296 WARN L234 SmtUtils]: Spent 24.12s on a formula simplification. DAG size of input: 172 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:05:23,498 INFO L356 Elim1Store]: treesize reduction 17, result has 90.1 percent of original size [2022-11-03 02:05:23,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 143 treesize of output 222 [2022-11-03 02:05:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:28,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:28,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2022-11-03 02:05:28,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1)))) is different from false [2022-11-03 02:05:28,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:28,570 INFO L390 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 38 [2022-11-03 02:05:29,907 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|))) (let ((.cse0 (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int) (v_ArrVal_7967 Int) (v_arrayElimCell_163 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967)))) (or (not (let ((.cse5 (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= .cse5 (select (select .cse6 .cse5) (+ v_arrayElimCell_163 12))))) (not (= (select (select (store .cse6 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1))))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (forall ((v_ArrVal_7971 (Array Int Int)) (v_ArrVal_7967 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store .cse4 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967)))) (or (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse2 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse1 .cse2) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) .cse2)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| 1)))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0)))) is different from false [2022-11-03 02:05:29,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse3))) (let ((.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int) (v_ArrVal_7967 Int) (v_arrayElimCell_163 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967)))) (or (not (let ((.cse8 (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= (select (select .cse7 .cse8) (+ v_arrayElimCell_163 12)) .cse8))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| 1)) (not (= (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| 1)) (forall ((v_ArrVal_7971 (Array Int Int)) (v_ArrVal_7967 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967)))) (or (not (let ((.cse2 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= (select (select .cse1 .cse2) .cse3) .cse2))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0)))))) is different from false [2022-11-03 02:05:30,016 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9)) .cse3))) (let ((.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int) (v_ArrVal_7967 Int) (v_arrayElimCell_163 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967)))) (or (not (let ((.cse8 (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= (select (select .cse7 .cse8) (+ v_arrayElimCell_163 12)) .cse8))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| 1)) (not (= (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (forall ((v_ArrVal_7971 (Array Int Int)) (v_ArrVal_7967 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967)))) (or (not (let ((.cse2 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= (select (select .cse1 .cse2) .cse3) .cse2))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1)))) (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)))))))) is different from false [2022-11-03 02:05:30,145 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9)) .cse3))) (let ((.cse4 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int) (v_ArrVal_7967 Int) (v_arrayElimCell_163 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967)))) (or (not (let ((.cse8 (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= (select (select .cse7 .cse8) (+ v_arrayElimCell_163 12)) .cse8))) (not (= (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1))))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (forall ((v_ArrVal_7971 (Array Int Int)) (v_ArrVal_7967 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967)))) (or (not (let ((.cse2 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse4))) (= (select (select .cse1 .cse2) .cse3) .cse2))) (not (= (select (select (store .cse1 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1)))))))))) is different from false [2022-11-03 02:05:30,282 INFO L390 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 216 treesize of output 162 [2022-11-03 02:05:30,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int) (v_ArrVal_7967 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_arrayElimCell_165 Int)) (let ((.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse2 (+ v_arrayElimCell_165 12))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3)) .cse2))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967))))) (or (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (= (select (select .cse0 .cse1) .cse2) .cse1))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| 1)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))))) is different from false [2022-11-03 02:05:30,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int) (v_ArrVal_7967 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_arrayElimCell_165 Int)) (let ((.cse3 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (.cse2 (+ v_arrayElimCell_165 12))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3)) .cse2))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967))))) (or (not (let ((.cse1 (select (select .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse3))) (= (select (select .cse0 .cse1) .cse2) .cse1))) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1)))))) is different from false [2022-11-03 02:05:30,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int) (v_ArrVal_7967 Int) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_arrayElimCell_165 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ v_arrayElimCell_165 12))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3)) .cse2))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_7967))))) (or (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1)) (not (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3))) (= .cse1 (select (select .cse0 .cse1) .cse2)))))))) is different from false [2022-11-03 02:05:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:05:30,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282567861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:05:30,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [715303016] [2022-11-03 02:05:30,376 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:05:30,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:05:30,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 16] total 45 [2022-11-03 02:05:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243134071] [2022-11-03 02:05:30,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:05:30,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 02:05:30,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 02:05:30,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1216, Unknown=19, NotChecked=720, Total=2162 [2022-11-03 02:05:30,381 INFO L87 Difference]: Start difference. First operand 2779 states and 6305 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) [2022-11-03 02:05:32,217 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (.cse5 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse6 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse1 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (and (or (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse3 (forall ((v_arrayElimCell_163 Int)) (not (= (select .cse0 (+ v_arrayElimCell_163 12)) .cse2))))) (and (not (= (select .cse0 .cse1) .cse2)) (or .cse3 .cse4) (or .cse5 .cse3))))) (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1))))) (let ((.cse10 (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|) .cse1 |c_pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base|)))) (or (let ((.cse8 (select (select .cse10 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6))) (let ((.cse9 (select .cse10 .cse8))) (let ((.cse7 (forall ((v_arrayElimCell_163 Int)) (not (= .cse8 (select .cse9 (+ v_arrayElimCell_163 12))))))) (and (or .cse4 .cse7) (not (= .cse8 (select .cse9 .cse1))) (or .cse5 .cse7))))) (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (not (= (select (select (store .cse10 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1)))))))) is different from false [2022-11-03 02:05:32,313 WARN L833 $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)) (let ((.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse4 (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|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base|)))) (or (let ((.cse1 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)))) (let ((.cse2 (select .cse4 .cse1))) (let ((.cse0 (forall ((v_arrayElimCell_163 Int)) (not (= .cse1 (select .cse2 (+ v_arrayElimCell_163 12))))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (not (= .cse1 (select .cse2 .cse3))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0))))) (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|)) is different from false [2022-11-03 02:05:33,005 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (or (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (let ((.cse2 (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12))) (and (= .cse0 (select .cse1 .cse2)) (exists ((v_prenex_14 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_prenex_14) .cse2))) (and (not (= v_prenex_14 0)) (= (select (select |c_#memory_$Pointer$.base| .cse3) |c_ULTIMATE.start_fifo_front_~self#1.offset|) v_prenex_14) (= .cse3 |c_ULTIMATE.start_fifo_front_~self#1.base|) (< v_prenex_14 |c_#StackHeapBarrier|))))))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (and (not (= .cse4 0)) (< .cse4 |c_#StackHeapBarrier|) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (= .cse0 (select .cse1 (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)))) (= .cse0 .cse4))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1))))) is different from false [2022-11-03 02:05:33,031 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse4 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse3 (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (or (let ((.cse0 (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (and (<= (+ 2 .cse0) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (= .cse1 (select .cse2 (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)))) .cse3 (= .cse1 .cse0))) (and (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int) (v_prenex_14 Int)) (let ((.cse5 (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_prenex_14) .cse5))) (and (not (= v_prenex_14 0)) (= .cse1 (select .cse2 .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse6) |c_ULTIMATE.start_fifo_front_~self#1.offset|) v_prenex_14) (= .cse6 |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ 2 v_prenex_14) |c_ULTIMATE.start_fifo_front_~self#1.base|))))) .cse3)))))) is different from false [2022-11-03 02:05:33,036 WARN L833 $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_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |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_330| 1)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|)) is different from false [2022-11-03 02:05:33,074 WARN L833 $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)) (not (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|)) (forall ((v_ArrVal_7971 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_330| v_ArrVal_7971) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))) is different from false [2022-11-03 02:05:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:33,755 INFO L93 Difference]: Finished difference Result 2950 states and 6760 transitions. [2022-11-03 02:05:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-03 02:05:33,755 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 [2022-11-03 02:05:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:33,759 INFO L225 Difference]: With dead ends: 2950 [2022-11-03 02:05:33,759 INFO L226 Difference]: Without dead ends: 2950 [2022-11-03 02:05:33,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=382, Invalid=2299, Unknown=31, NotChecked=1710, Total=4422 [2022-11-03 02:05:33,763 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2269 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:33,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 103 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1039 Invalid, 0 Unknown, 2269 Unchecked, 1.1s Time] [2022-11-03 02:05:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2022-11-03 02:05:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2813. [2022-11-03 02:05:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2802 states have (on average 2.2858672376873663) internal successors, (6405), 2812 states have internal predecessors, (6405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 6405 transitions. [2022-11-03 02:05:33,797 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 6405 transitions. Word has length 23 [2022-11-03 02:05:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:33,797 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 6405 transitions. [2022-11-03 02:05:33,797 INFO L496 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) [2022-11-03 02:05:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 6405 transitions. [2022-11-03 02:05:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:05:33,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:33,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:33,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:33,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:34,000 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:05:34,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1189309804, now seen corresponding path program 8 times [2022-11-03 02:05:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:34,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727620712] [2022-11-03 02:05:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:35,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:35,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727620712] [2022-11-03 02:05:35,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727620712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:35,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012556669] [2022-11-03 02:05:35,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:05:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:35,547 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:35,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:05:36,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:05:36,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:05:36,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-03 02:05:36,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:36,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,272 INFO L390 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 [2022-11-03 02:05:36,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,290 INFO L390 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 [2022-11-03 02:05:36,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,301 INFO L390 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 [2022-11-03 02:05:36,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,314 INFO L390 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 [2022-11-03 02:05:36,322 INFO L390 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 36 treesize of output 44 [2022-11-03 02:05:36,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,332 INFO L390 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 [2022-11-03 02:05:36,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,340 INFO L390 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 [2022-11-03 02:05:36,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,350 INFO L390 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 [2022-11-03 02:05:36,912 INFO L390 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 [2022-11-03 02:05:37,108 INFO L356 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-11-03 02:05:37,108 INFO L390 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 [2022-11-03 02:05:37,125 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:37,125 INFO L390 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 [2022-11-03 02:05:37,261 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:05:37,262 INFO L390 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 [2022-11-03 02:05:37,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:37,454 INFO L390 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 [2022-11-03 02:05:37,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:37,517 INFO L390 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 [2022-11-03 02:05:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:37,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:37,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2022-11-03 02:05:37,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) is different from false [2022-11-03 02:05:37,591 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8178 (Array Int Int)) (v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_8178) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) is different from false [2022-11-03 02:05:37,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8178 (Array Int Int)) (v_ArrVal_8179 (Array Int Int)) (v_ArrVal_8176 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_8176) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_8178) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) is different from false [2022-11-03 02:05:37,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8178 (Array Int Int)) (v_ArrVal_8179 (Array Int Int)) (v_ArrVal_8176 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_ArrVal_8176) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_8178) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) is different from false [2022-11-03 02:05:37,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8178 (Array Int Int)) (v_ArrVal_8179 (Array Int Int)) (v_ArrVal_8176 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| 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_8176) .cse0 v_ArrVal_8178))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) is different from false [2022-11-03 02:05:37,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8178 (Array Int Int)) (v_ArrVal_8179 (Array Int Int)) (v_ArrVal_8176 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| 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_8176) .cse0 v_ArrVal_8178))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) is different from false [2022-11-03 02:05:37,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8178 (Array Int Int)) (v_ArrVal_8179 (Array Int Int)) (v_ArrVal_8176 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| 1)) (not (= (select (select (store (let ((.cse1 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (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_8176) .cse0 v_ArrVal_8178))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2022-11-03 02:05:37,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8178 (Array Int Int)) (v_ArrVal_8179 (Array Int Int)) (v_ArrVal_8176 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| 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_8176) .cse0 v_ArrVal_8178))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) is different from false [2022-11-03 02:05:37,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8178 (Array Int Int)) (v_ArrVal_8179 (Array Int Int)) (v_ArrVal_8176 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (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) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) v_ArrVal_8176) .cse0 v_ArrVal_8178))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) is different from false [2022-11-03 02:05:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:05:37,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012556669] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:05:37,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [437447670] [2022-11-03 02:05:37,725 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:05:37,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:05:37,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 12] total 40 [2022-11-03 02:05:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169471825] [2022-11-03 02:05:37,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:05:37,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-03 02:05:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:37,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-03 02:05:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=877, Unknown=10, NotChecked=690, Total=1722 [2022-11-03 02:05:37,728 INFO L87 Difference]: Start difference. First operand 2813 states and 6405 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) [2022-11-03 02:05:41,370 WARN L833 $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.offset| 0) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (< .cse0 |c_#StackHeapBarrier|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 0) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) (= .cse0 (select .cse1 4))))) is different from false [2022-11-03 02:05:41,477 WARN L833 $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.offset| 0) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (< .cse0 |c_#StackHeapBarrier|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) (or (not (= (select .cse1 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) 4)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) 4))) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse2) 12)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 4))))) is different from false [2022-11-03 02:05:41,481 WARN L833 $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.offset| 0) (< .cse0 |c_#StackHeapBarrier|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) (= .cse0 (select .cse1 4))))) is different from false [2022-11-03 02:05:41,523 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (or (not (= (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (= (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12))))) (< .cse1 |c_#StackHeapBarrier|) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse1 (select .cse0 4))))) is different from false [2022-11-03 02:05:41,584 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (or (not (= (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (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))))) (< .cse1 |c_#StackHeapBarrier|) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |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_332| 1)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse1 (select .cse0 4))))) is different from false [2022-11-03 02:05:41,745 WARN L833 $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.offset| 0) (<= (+ .cse0 2) |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8179 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| Int)) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_332| v_ArrVal_8179) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (not (= .cse0 0)) (= .cse0 (select .cse1 4))))) is different from false [2022-11-03 02:05:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:44,676 INFO L93 Difference]: Finished difference Result 3932 states and 8965 transitions. [2022-11-03 02:05:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 02:05:44,677 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 [2022-11-03 02:05:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:44,682 INFO L225 Difference]: With dead ends: 3932 [2022-11-03 02:05:44,682 INFO L226 Difference]: Without dead ends: 3932 [2022-11-03 02:05:44,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=575, Invalid=2665, Unknown=16, NotChecked=2000, Total=5256 [2022-11-03 02:05:44,683 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1275 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 3567 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6276 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:44,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 86 Invalid, 9886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3567 Invalid, 0 Unknown, 6276 Unchecked, 3.5s Time] [2022-11-03 02:05:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2022-11-03 02:05:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 2892. [2022-11-03 02:05:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2881 states have (on average 2.287747309961819) internal successors, (6591), 2891 states have internal predecessors, (6591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 6591 transitions. [2022-11-03 02:05:44,719 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 6591 transitions. Word has length 23 [2022-11-03 02:05:44,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:44,719 INFO L495 AbstractCegarLoop]: Abstraction has 2892 states and 6591 transitions. [2022-11-03 02:05:44,719 INFO L496 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) [2022-11-03 02:05:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 6591 transitions. [2022-11-03 02:05:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:05:44,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:44,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:44,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:44,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-11-03 02:05:44,926 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:05:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1191472054, now seen corresponding path program 9 times [2022-11-03 02:05:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:44,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382960315] [2022-11-03 02:05:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:46,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:46,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382960315] [2022-11-03 02:05:46,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382960315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:46,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061875539] [2022-11-03 02:05:46,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:05:46,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:46,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:46,344 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:46,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:05:46,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:05:46,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:05:46,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-03 02:05:46,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:46,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,941 INFO L390 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 [2022-11-03 02:05:46,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,959 INFO L390 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 [2022-11-03 02:05:46,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,969 INFO L390 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 [2022-11-03 02:05:46,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,980 INFO L390 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 [2022-11-03 02:05:46,987 INFO L390 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 36 treesize of output 44 [2022-11-03 02:05:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:46,997 INFO L390 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 [2022-11-03 02:05:47,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:47,010 INFO L390 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 [2022-11-03 02:05:47,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:47,018 INFO L390 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 37 treesize of output 41 [2022-11-03 02:05:47,534 INFO L390 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 116 treesize of output 80 [2022-11-03 02:05:48,549 INFO L356 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-11-03 02:05:48,549 INFO L390 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 82 [2022-11-03 02:05:48,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:48,558 INFO L390 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 54 treesize of output 28 [2022-11-03 02:05:48,652 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:05:48,652 INFO L390 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 [2022-11-03 02:05:48,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:48,825 INFO L390 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 [2022-11-03 02:05:48,892 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:48,892 INFO L390 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 [2022-11-03 02:05:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:48,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:48,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334|))) is different from false [2022-11-03 02:05:48,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2022-11-03 02:05:49,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8382 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_8382) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2022-11-03 02:05:49,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8381 (Array Int Int)) (v_ArrVal_8382 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= 0 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_8381) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_8382) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2022-11-03 02:05:49,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8381 (Array Int Int)) (v_ArrVal_8382 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_ArrVal_8381) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| v_ArrVal_8382) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2022-11-03 02:05:49,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8381 (Array Int Int)) (v_ArrVal_8382 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (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_8381) .cse0 v_ArrVal_8382))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |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_334| 1)))) is different from false [2022-11-03 02:05:49,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8381 (Array Int Int)) (v_ArrVal_8382 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (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_8381) .cse0 v_ArrVal_8382))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2022-11-03 02:05:49,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8381 (Array Int Int)) (v_ArrVal_8382 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store (let ((.cse1 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (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_8381) .cse0 v_ArrVal_8382))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2022-11-03 02:05:49,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8381 (Array Int Int)) (v_ArrVal_8382 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (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_8381) .cse0 v_ArrVal_8382))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |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_334| 1)))) is different from false [2022-11-03 02:05:49,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8381 (Array Int Int)) (v_ArrVal_8382 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (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) (+ 12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse1))) v_ArrVal_8381) .cse0 v_ArrVal_8382))) |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))) is different from false [2022-11-03 02:05:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:05:49,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061875539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:05:49,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1961288543] [2022-11-03 02:05:49,193 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:05:49,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:05:49,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 39 [2022-11-03 02:05:49,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591129437] [2022-11-03 02:05:49,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:05:49,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 02:05:49,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:49,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 02:05:49,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=845, Unknown=11, NotChecked=670, Total=1640 [2022-11-03 02:05:49,196 INFO L87 Difference]: Start difference. First operand 2892 states and 6591 transitions. Second operand has 41 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:55,203 WARN L833 $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.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 0) (= .cse0 (select .cse1 4)) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2022-11-03 02:05:55,266 WARN L833 $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.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (< .cse0 |c_#StackHeapBarrier|) (not (= .cse0 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 4))))) is different from false [2022-11-03 02:05:55,282 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse1 (select .cse2 0))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) .cse0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (< .cse1 |c_#StackHeapBarrier|) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= (select .cse2 .cse0) (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse1 (select .cse2 4))))) is different from false [2022-11-03 02:05:55,363 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) (.cse2 (select .cse3 0)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_empty_~self#1.base|) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_front_~self#1.offset|) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (< .cse2 |c_#StackHeapBarrier|) (not (= .cse2 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse1)) (= .cse2 (select .cse3 4)) (= (select .cse0 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)))) is different from false [2022-11-03 02:05:55,573 WARN L833 $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.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334|))) (<= (+ .cse0 2) |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= .cse0 0)) (= .cse0 (select .cse1 4))))) is different from false [2022-11-03 02:05:55,643 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)) (.cse0 (select .cse3 0)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (and (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| Int) (v_ArrVal_8383 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334| v_ArrVal_8383) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_334|))) (<= (+ .cse0 2) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= (select .cse1 .cse2) 0) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_front_~self#1.offset|) (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|)) (not (= .cse0 0)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) .cse2)) (= .cse0 (select .cse3 4)) (= (select .cse1 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)))) is different from false [2022-11-03 02:05:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:57,823 INFO L93 Difference]: Finished difference Result 3487 states and 7892 transitions. [2022-11-03 02:05:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-03 02:05:57,823 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.7) internal successors, (68), 40 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 [2022-11-03 02:05:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:57,827 INFO L225 Difference]: With dead ends: 3487 [2022-11-03 02:05:57,827 INFO L226 Difference]: Without dead ends: 3487 [2022-11-03 02:05:57,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=281, Invalid=2519, Unknown=20, NotChecked=1872, Total=4692 [2022-11-03 02:05:57,828 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 229 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 3246 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 5998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2737 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:57,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 114 Invalid, 5998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3246 Invalid, 0 Unknown, 2737 Unchecked, 2.8s Time] [2022-11-03 02:05:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2022-11-03 02:05:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 2918. [2022-11-03 02:05:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2907 states have (on average 2.2899896800825594) internal successors, (6657), 2917 states have internal predecessors, (6657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 6657 transitions. [2022-11-03 02:05:57,865 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 6657 transitions. Word has length 23 [2022-11-03 02:05:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:57,865 INFO L495 AbstractCegarLoop]: Abstraction has 2918 states and 6657 transitions. [2022-11-03 02:05:57,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 6657 transitions. [2022-11-03 02:05:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:05:57,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:57,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:57,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:58,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-11-03 02:05:58,068 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:05:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1010966772, now seen corresponding path program 10 times [2022-11-03 02:05:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:58,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279349250] [2022-11-03 02:05:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:06:01,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:01,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279349250] [2022-11-03 02:06:01,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279349250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:01,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27137324] [2022-11-03 02:06:01,721 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:06:01,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:01,722 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:06:01,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:06:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:02,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-03 02:06:02,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:02,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:02,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:02,369 INFO L390 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 [2022-11-03 02:06:02,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:02,377 INFO L390 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 [2022-11-03 02:06:02,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:02,390 INFO L390 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 [2022-11-03 02:06:02,418 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 02:06:02,419 INFO L390 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 92 treesize of output 86 [2022-11-03 02:06:02,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:02,432 INFO L390 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 [2022-11-03 02:06:02,437 INFO L390 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 36 treesize of output 56 [2022-11-03 02:06:03,701 INFO L356 Elim1Store]: treesize reduction 60, result has 26.8 percent of original size [2022-11-03 02:06:03,702 INFO L390 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 132 treesize of output 118 [2022-11-03 02:06:03,730 INFO L356 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-03 02:06:03,731 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 38 [2022-11-03 02:06:03,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:03,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:03,779 INFO L390 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 73 treesize of output 39 [2022-11-03 02:06:03,924 INFO L356 Elim1Store]: treesize reduction 23, result has 20.7 percent of original size [2022-11-03 02:06:03,925 INFO L390 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 62 treesize of output 50 [2022-11-03 02:06:04,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:04,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:04,480 INFO L356 Elim1Store]: treesize reduction 256, result has 14.1 percent of original size [2022-11-03 02:06:04,480 INFO L390 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 114 treesize of output 95 [2022-11-03 02:06:04,501 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-11-03 02:06:04,501 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 112 [2022-11-03 02:06:04,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:04,898 INFO L390 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 140 treesize of output 128 [2022-11-03 02:06:05,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,540 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:06:05,540 INFO L390 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 [2022-11-03 02:06:05,551 INFO L390 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 [2022-11-03 02:06:05,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:05,655 INFO L390 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 [2022-11-03 02:06:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:06:05,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:05,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2022-11-03 02:06:05,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) is different from false [2022-11-03 02:06:06,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse1 (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (.cse2 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse4 (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse1 .cse2 v_ArrVal_8592))) (.cse0 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_8588))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (let ((.cse8 (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (store .cse8 .cse2 (select .cse8 .cse2))))))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< v_ArrVal_8592 (+ 4 (select .cse1 .cse2))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3))) (not (= (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (not (let ((.cse6 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse5 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6))) (= .cse5 (select (select .cse0 .cse5) (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6) 12))))))))))) is different from false [2022-11-03 02:06:06,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse3))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse2 (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse0 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_8588))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (let ((.cse9 (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (store .cse9 .cse3 (select .cse9 .cse3)))))) (.cse5 (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse2 .cse3 v_ArrVal_8592))) (.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (< v_ArrVal_8592 (+ (select .cse2 .cse3) 4)) (not (= (select (select (store .cse0 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse6 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse4 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6))) (= .cse4 (select (select .cse0 .cse4) (+ 12 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6))))))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)))))))))) is different from false [2022-11-03 02:06:06,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (.cse8 (+ 12 .cse2))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| .cse6) .cse8))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse7 (select .cse12 .cse6))) (let ((.cse0 (store .cse12 .cse6 (store .cse7 .cse8 v_ArrVal_8592))) (.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_8588))) (store .cse9 .cse6 (let ((.cse10 (select .cse9 .cse6))) (store .cse10 .cse8 (select .cse10 .cse8))))))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse2)) (not (let ((.cse5 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5))) (= .cse3 (select (select .cse4 .cse3) (+ 12 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse6)) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< v_ArrVal_8592 (+ 4 (select .cse7 .cse8)))))))))))) is different from false [2022-11-03 02:06:06,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)) (.cse8 (+ 12 .cse2))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| .cse6) .cse8))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse7 (select .cse12 .cse6))) (let ((.cse0 (store .cse12 .cse6 (store .cse7 .cse8 v_ArrVal_8592))) (.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_8588))) (store .cse9 .cse6 (let ((.cse10 (select .cse9 .cse6))) (store .cse10 .cse8 (select .cse10 .cse8))))))) (or (not (= (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse2)) (not (let ((.cse5 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5))) (= .cse3 (select (select .cse4 .cse3) (+ 12 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse5))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) .cse6)) (< v_ArrVal_8592 (+ 4 (select .cse7 .cse8))) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))))))))) is different from false [2022-11-03 02:06:06,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:06,755 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 3955 treesize of output 2942 [2022-11-03 02:06:07,215 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (let ((.cse7 (= |c_pusherThread1of1ForFork0_~q~0#1.base| .cse1)) (.cse6 (select |c_#memory_$Pointer$.base| .cse1))) (and (or (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select .cse6 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse4 .cse1 (let ((.cse5 (select .cse4 .cse1))) (store .cse5 v_arrayElimIndex_27 (select .cse5 v_arrayElimIndex_27))))))) (let ((.cse0 (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (or (not (= .cse0 .cse1)) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse2 .cse0) v_arrayElimIndex_27) .cse0)))))) .cse7) (or (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| (select .cse6 .cse3) v_ArrVal_8588))) (store .cse9 .cse1 (let ((.cse10 (select .cse9 .cse1))) (store .cse10 .cse3 (select .cse10 .cse3))))))) (or (not (= (select (select (store .cse8 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |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_336| 1)) (not (= (select (select .cse8 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) .cse1))))) (not .cse7)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (forall ((v_ArrVal_8588 (Array Int Int)) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| (select .cse6 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse13 .cse1 (let ((.cse14 (select .cse13 .cse1))) (store .cse14 v_arrayElimIndex_27 (select .cse14 v_arrayElimIndex_27))))))) (let ((.cse11 (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (or (not (= .cse11 .cse1)) (not (= (select (select (store .cse12 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse12 .cse11) v_arrayElimIndex_27) .cse11)) (= v_arrayElimIndex_27 .cse3))))))))))) is different from false [2022-11-03 02:06:07,278 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse0))) (let ((.cse10 (= .cse2 |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| .cse2))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (forall ((v_ArrVal_8588 (Array Int Int)) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select .cse6 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse4 .cse2 (let ((.cse5 (select .cse4 .cse2))) (store .cse5 v_arrayElimIndex_27 (select .cse5 v_arrayElimIndex_27))))))) (let ((.cse1 (select (select .cse3 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse0))) (or (= .cse0 v_arrayElimIndex_27) (not (= .cse1 .cse2)) (not (= .cse1 (select (select .cse3 .cse1) v_arrayElimIndex_27))) (not (= (select (select (store .cse3 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))))))) (or (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| (select .cse6 .cse0) v_ArrVal_8588))) (store .cse8 .cse2 (let ((.cse9 (select .cse8 .cse2))) (store .cse9 .cse0 (select .cse9 .cse0))))))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select .cse7 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse0) .cse2)) (not (= (select (select (store .cse7 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))) (not .cse10)) (or .cse10 (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| (select .cse6 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse13 .cse2 (let ((.cse14 (select .cse13 .cse2))) (store .cse14 v_arrayElimIndex_27 (select .cse14 v_arrayElimIndex_27))))))) (let ((.cse11 (select (select .cse12 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse0))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= .cse11 .cse2)) (not (= .cse11 (select (select .cse12 .cse11) v_arrayElimIndex_27))) (not (= (select (select (store .cse12 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))))))))) is different from false [2022-11-03 02:06:07,341 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse0))) (let ((.cse7 (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse3)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (forall ((v_ArrVal_8588 (Array Int Int)) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select .cse6 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse4 .cse3 (let ((.cse5 (select .cse4 .cse3))) (store .cse5 v_arrayElimIndex_27 (select .cse5 v_arrayElimIndex_27))))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse0))) (or (= .cse0 v_arrayElimIndex_27) (not (= .cse1 (select (select .cse2 .cse1) v_arrayElimIndex_27))) (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse1 .cse3)))))))) (or .cse7 (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| (select .cse6 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse10 .cse3 (let ((.cse11 (select .cse10 .cse3))) (store .cse11 v_arrayElimIndex_27 (select .cse11 v_arrayElimIndex_27))))))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse0))) (or (not (= .cse8 (select (select .cse9 .cse8) v_arrayElimIndex_27))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store .cse9 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse8 .cse3))))))) (or (not .cse7) (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| (select .cse6 .cse0) v_ArrVal_8588))) (store .cse13 .cse3 (let ((.cse14 (select .cse13 .cse3))) (store .cse14 .cse0 (select .cse14 .cse0))))))) (or (not (= (select (select (store .cse12 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |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_336| 1)) (not (= .cse3 (select (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse0))))))))))) is different from false [2022-11-03 02:06:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:06:07,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27137324] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:07,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617670625] [2022-11-03 02:06:07,345 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 02:06:07,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:06:07,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 51 [2022-11-03 02:06:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713704349] [2022-11-03 02:06:07,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:06:07,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-03 02:06:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-03 02:06:07,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1705, Unknown=9, NotChecked=828, Total=2756 [2022-11-03 02:06:07,348 INFO L87 Difference]: Start difference. First operand 2918 states and 6657 transitions. Second operand has 53 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 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) [2022-11-03 02:06:07,628 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse1 (select .cse17 .cse3))) (let ((.cse0 (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse17 4)) (.cse9 (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse1)) (.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) 4) 0) (not (= .cse0 0)) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse2) 12) 4) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (forall ((v_ArrVal_8588 (Array Int Int)) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| (select .cse8 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse6 .cse1 (let ((.cse7 (select .cse6 .cse1))) (store .cse7 v_arrayElimIndex_27 (select .cse7 v_arrayElimIndex_27))))))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3))) (or (= .cse3 v_arrayElimIndex_27) (not (= .cse4 (select (select .cse5 .cse4) v_arrayElimIndex_27))) (not (= (select (select (store .cse5 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse4 .cse1)))))))) (or .cse9 (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| (select .cse8 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse12 .cse1 (let ((.cse13 (select .cse12 .cse1))) (store .cse13 v_arrayElimIndex_27 (select .cse13 v_arrayElimIndex_27))))))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3))) (or (not (= .cse10 (select (select .cse11 .cse10) v_arrayElimIndex_27))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store .cse11 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= .cse10 .cse1))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (and (= .cse1 (select .cse8 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse8 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse1 (select .cse8 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12))))) (< .cse1 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse2)) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (or (not .cse9) (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.base| (select .cse8 .cse3) v_ArrVal_8588))) (store .cse15 .cse1 (let ((.cse16 (select .cse15 .cse1))) (store .cse16 .cse3 (select .cse16 .cse3))))))) (or (not (= (select (select (store .cse14 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |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_336| 1)) (not (= .cse1 (select (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3))))))))))) is different from false [2022-11-03 02:06:07,638 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse1 (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse3 (select .cse0 .cse1))) (let ((.cse14 (= .cse3 |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| .cse3)) (.cse10 (select .cse0 4)) (.cse9 (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (and (not (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (forall ((v_ArrVal_8588 (Array Int Int)) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| (select .cse7 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse5 .cse3 (let ((.cse6 (select .cse5 .cse3))) (store .cse6 v_arrayElimIndex_27 (select .cse6 v_arrayElimIndex_27))))))) (let ((.cse2 (select (select .cse4 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (or (= .cse1 v_arrayElimIndex_27) (not (= .cse2 .cse3)) (not (= .cse2 (select (select .cse4 .cse2) v_arrayElimIndex_27))) (not (= (select (select (store .cse4 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))))))) (not (= 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse9) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select (select |c_#memory_$Pointer$.offset| .cse10) 12) 4) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_#in~q_#1.base|) 4) 0) (or (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| (select .cse7 .cse1) v_ArrVal_8588))) (store .cse12 .cse3 (let ((.cse13 (select .cse12 .cse3))) (store .cse13 .cse1 (select .cse13 .cse1))))))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select .cse11 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1) .cse3)) (not (= (select (select (store .cse11 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))) (not .cse14)) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (or .cse14 (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| (select .cse7 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse17 .cse3 (let ((.cse18 (select .cse17 .cse3))) (store .cse18 v_arrayElimIndex_27 (select .cse18 v_arrayElimIndex_27))))))) (let ((.cse15 (select (select .cse16 |c_pusherThread1of1ForFork0_#in~q_#1.base|) .cse1))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= .cse15 .cse3)) (not (= .cse15 (select (select .cse16 .cse15) v_arrayElimIndex_27))) (not (= (select (select (store .cse16 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |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 ((.cse19 (select |c_#memory_$Pointer$.base| .cse9))) (and (= .cse9 (select .cse19 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse19 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse9 (select .cse19 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))))) (< .cse9 |c_#StackHeapBarrier|) (not (= .cse10 |c_pusherThread1of1ForFork0_#in~q_#1.base|)) (not (= .cse9 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|))))) is different from false [2022-11-03 02:06:07,648 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse3 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (select .cse10 .cse3))) (let ((.cse7 (= |c_pusherThread1of1ForFork0_~q~0#1.base| .cse1)) (.cse11 (select .cse10 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse1)) (.cse9 (select .cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_~q~0#1.base|) 4)) (not (= 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (or (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select .cse6 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse4 .cse1 (let ((.cse5 (select .cse4 .cse1))) (store .cse5 v_arrayElimIndex_27 (select .cse5 v_arrayElimIndex_27))))))) (let ((.cse0 (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (or (not (= .cse0 .cse1)) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse2 .cse0) v_arrayElimIndex_27) .cse0)))))) .cse7) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse9) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (<= (select (select |c_#memory_$Pointer$.offset| .cse11) 12) 4) (or (forall ((v_ArrVal_8588 (Array Int Int)) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| (select .cse6 .cse3) v_ArrVal_8588))) (store .cse13 .cse1 (let ((.cse14 (select .cse13 .cse1))) (store .cse14 .cse3 (select .cse14 .cse3))))))) (or (not (= (select (select (store .cse12 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |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_336| 1)) (not (= (select (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) .cse1))))) (not .cse7)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse15 (select |c_#memory_$Pointer$.base| .cse9))) (and (= .cse9 (select .cse15 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse15 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse9 (select .cse15 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))))) (< .cse9 |c_#StackHeapBarrier|) (not (= .cse11 |c_pusherThread1of1ForFork0_~q~0#1.base|)) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int)) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (forall ((v_ArrVal_8588 (Array Int Int)) (v_arrayElimIndex_27 Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| (select .cse6 v_arrayElimIndex_27) v_ArrVal_8588))) (store .cse18 .cse1 (let ((.cse19 (select .cse18 .cse1))) (store .cse19 v_arrayElimIndex_27 (select .cse19 v_arrayElimIndex_27))))))) (let ((.cse16 (select (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) (or (not (= .cse16 .cse1)) (not (= (select (select (store .cse17 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (not (= (select (select .cse17 .cse16) v_arrayElimIndex_27) .cse16)) (= v_arrayElimIndex_27 .cse3))))))) (not (= .cse9 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-11-03 02:06:07,657 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse17 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse1 (select .cse5 4)) (.cse0 (select .cse5 .cse7)) (.cse4 (select .cse17 .cse7)) (.cse3 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (and (or (not (= .cse0 .cse1)) (<= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base|) 12) 4)) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| .cse0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse3) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| .cse4) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse1)) (not (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (not (= (select (select |c_#memory_$Pointer$.offset| .cse1) 12) 12)) (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse12 (+ 12 .cse4))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| .cse0) .cse12))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse15 (store (select |c_#memory_$Pointer$.offset| .cse15) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse11 (select .cse16 .cse0))) (let ((.cse6 (store .cse16 .cse0 (store .cse11 .cse12 v_ArrVal_8592))) (.cse9 (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse15 v_ArrVal_8588))) (store .cse13 .cse0 (let ((.cse14 (select .cse13 .cse0))) (store .cse14 .cse12 (select .cse14 .cse12))))))) (or (not (= (select (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) .cse4)) (not (let ((.cse10 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse8 (select (select .cse9 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10))) (= .cse8 (select (select .cse9 .cse8) (+ 12 (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) .cse0)) (< v_ArrVal_8592 (+ 4 (select .cse11 .cse12))) (not (= (select (select (store .cse9 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0))))))))) (= (select .cse17 4) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse3))) (and (= .cse3 (select .cse18 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse18 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse3 (select .cse18 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))))) (< .cse3 |c_#StackHeapBarrier|) (not (= .cse3 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-11-03 02:06:07,686 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse2 (select .cse3 4)) (.cse4 (select .cse3 .cse6)) (.cse17 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse1 (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse2)) (not (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (or (<= (select (select |c_#memory_$Pointer$.offset| .cse4) 12) 4) (not (= .cse4 .cse2))) (not (= (select (select |c_#memory_$Pointer$.offset| .cse2) 12) 12)) (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse7 (select .cse17 .cse6))) (let ((.cse12 (+ 12 .cse7))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| .cse4) .cse12))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse15 (store (select |c_#memory_$Pointer$.offset| .cse15) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse11 (select .cse16 .cse4))) (let ((.cse5 (store .cse16 .cse4 (store .cse11 .cse12 v_ArrVal_8592))) (.cse9 (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse15 v_ArrVal_8588))) (store .cse13 .cse4 (let ((.cse14 (select .cse13 .cse4))) (store .cse14 .cse12 (select .cse14 .cse12))))))) (or (not (= (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) .cse7)) (not (let ((.cse10 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse8 (select (select .cse9 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10))) (= .cse8 (select (select .cse9 .cse8) (+ 12 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse10))))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6) .cse4)) (< v_ArrVal_8592 (+ 4 (select .cse11 .cse12))) (not (= (select (select (store .cse9 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 0)))))))))) (= (select .cse17 4) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#q~1#1.base|) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse1))) (and (= .cse1 (select .cse18 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= (select .cse18 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0) (= .cse1 (select .cse18 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12)))))) (< .cse1 |c_#StackHeapBarrier|) (not (= .cse1 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-11-03 02:06:07,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse12 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse3 (select .cse6 4)) (.cse1 (select .cse0 .cse12)) (.cse4 (select .cse6 .cse8)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse1) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (and (= .cse1 (select .cse2 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= .cse1 (select .cse2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12))) (= (select .cse2 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse3)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (or (<= (select (select |c_#memory_$Pointer$.offset| .cse4) 12) 4) (not (= .cse4 .cse3))) (not (= (select (select |c_#memory_$Pointer$.offset| .cse3) 12) 12)) (not (= .cse1 0)) (< .cse1 |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= (select .cse5 4) 0) (not (= (select .cse6 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse9 (select .cse5 .cse8))) (let ((.cse14 (+ 12 .cse9))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| .cse4) .cse14))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| .cse17 (store (select |c_#memory_$Pointer$.offset| .cse17) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse13 (select .cse18 .cse4))) (let ((.cse7 (store .cse18 .cse4 (store .cse13 .cse14 v_ArrVal_8592))) (.cse11 (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_8588))) (store .cse15 .cse4 (let ((.cse16 (select .cse15 .cse4))) (store .cse16 .cse14 (select .cse16 .cse14))))))) (or (not (= (select (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) .cse9)) (not (let ((.cse10 (select (select .cse11 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse12))) (= .cse10 (select (select .cse11 .cse10) (+ 12 (select (select .cse7 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse12)))))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) .cse4)) (not (= (select (select (store .cse11 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< v_ArrVal_8592 (+ 4 (select .cse13 .cse14)))))))))))))) is different from false [2022-11-03 02:06:07,819 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse7 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse17 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (let ((.cse15 (select .cse17 4)) (.cse13 (select .cse12 .cse7)) (.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= (select .cse0 .cse1) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (not (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse3 (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse2 (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_8588))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (let ((.cse10 (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (store .cse10 .cse4 (select .cse10 .cse4)))))) (.cse6 (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse3 .cse4 v_ArrVal_8592)))) (or (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (< v_ArrVal_8592 (+ (select .cse3 .cse4) 4)) (not (= (select (select (store .cse2 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (not (let ((.cse5 (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7))) (= .cse5 (select (select .cse2 .cse5) (+ 12 (select (select .cse6 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse7)))))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| (select (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1)))))))))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= (select .cse12 |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse13) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (and (= .cse13 (select .cse14 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= .cse13 (select .cse14 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12))) (= (select .cse14 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| .cse15)) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (let ((.cse16 (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse15))) (or (and (<= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) 12) 4) .cse16) (and (not (= (select (select |c_#memory_$Pointer$.offset| .cse15) 12) 12)) (not .cse16)) (and .cse16 (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 0)))) (not (= .cse13 0)) (< .cse13 |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select .cse17 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= (select .cse0 4) 0) (not (= (select .cse17 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))))) is different from false [2022-11-03 02:06:07,868 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse25 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) (.cse22 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse11 (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse22)) (.cse18 (select .cse17 .cse25)) (.cse15 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|)) (.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse13 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse29 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|)) (.cse14 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|))) (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|))) (let ((.cse6 (select .cse16 4))) (let ((.cse4 (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| .cse6))) (let ((.cse2 (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (.cse3 (not (= (select .cse16 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) (.cse10 (= (select .cse15 4) 0)) (.cse8 (not (= (select (select |c_#memory_$Pointer$.offset| .cse6) 12) 12))) (.cse9 (not .cse4)) (.cse12 (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| 4)))) (or (and (= |c_ULTIMATE.start_fifo_front_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|)) (or (and .cse2 .cse3) (and (let ((.cse7 (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| 0))) (or (and .cse4 (not (= .cse5 .cse6)) .cse7) (and (<= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) 12) 4) (not .cse7) .cse4) (and .cse8 (not (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| .cse6)) .cse9))) .cse10 .cse11 .cse12))) (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (or (and .cse13 .cse2 .cse3) (and .cse0 .cse10 .cse8 .cse9 (not (= (+ 8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) 0)) .cse12))) (not .cse14)))))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= (select .cse17 |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse18) (exists ((|ULTIMATE.start_fifo_node_init_~self#1.offset| Int)) (let ((.cse19 (select |c_#memory_$Pointer$.base| .cse18))) (and (= .cse18 (select .cse19 |ULTIMATE.start_fifo_node_init_~self#1.offset|)) (= .cse18 (select .cse19 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 12))) (= (select .cse19 (+ |ULTIMATE.start_fifo_node_init_~self#1.offset| 16)) 0)))) .cse11 (= .cse5 |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) (not (= .cse18 0)) (< .cse18 |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (forall ((v_ArrVal_8592 Int) (v_ArrVal_8588 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| Int) (v_ArrVal_8589 Int) (|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store .cse15 |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| v_ArrVal_8589)))) (let ((.cse21 (select .cse28 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (let ((.cse23 (store .cse28 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store .cse21 .cse22 v_ArrVal_8592))) (.cse20 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_8588))) (store .cse26 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (let ((.cse27 (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) (store .cse27 .cse22 (select .cse27 .cse22))))))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store .cse20 |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)) (< v_ArrVal_8592 (+ 4 (select .cse21 .cse22))) (not (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1))) (not (= (select (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) (not (let ((.cse24 (select (select .cse20 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse25))) (= .cse24 (select (select .cse20 .cse24) (+ (select (select .cse23 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse25) 12)))))))))) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select .cse29 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_fifo_front_~self#1.base|) (or (and .cse13 (not (= (select .cse29 |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0))) .cse14)))) is different from false [2022-11-03 02:06:09,400 WARN L833 $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_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (and (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |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) (not (= .cse0 0)) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse0) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)))) (< .cse0 |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2022-11-03 02:06:09,599 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))))) (and .cse0 (or .cse0 (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))))))) is different from false [2022-11-03 02:06:09,621 WARN L833 $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_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (and (<= (+ 2 .cse0) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| 0) (not (= .cse0 0)) (exists ((|pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| Int)) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse0) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| 12)))) (forall ((|v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| Int) (v_ArrVal_8594 (Array Int Int))) (or (< |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336|) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_fifo_node_init_~self#1.base_336| v_ArrVal_8594) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 0)))) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.base|) (= .cse0 (select .cse1 |c_ULTIMATE.start_fifo_front_~self#1.offset|))))) is different from false [2022-11-03 02:06:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:12,934 INFO L93 Difference]: Finished difference Result 3685 states and 8498 transitions. [2022-11-03 02:06:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-03 02:06:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 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 [2022-11-03 02:06:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:12,939 INFO L225 Difference]: With dead ends: 3685 [2022-11-03 02:06:12,939 INFO L226 Difference]: Without dead ends: 3685 [2022-11-03 02:06:12,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=308, Invalid=2614, Unknown=20, NotChecked=2460, Total=5402 [2022-11-03 02:06:12,940 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 170 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 3273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7383 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:12,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 116 Invalid, 10660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3273 Invalid, 0 Unknown, 7383 Unchecked, 3.7s Time] [2022-11-03 02:06:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2022-11-03 02:06:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 2968. [2022-11-03 02:06:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2957 states have (on average 2.300304362529591) internal successors, (6802), 2967 states have internal predecessors, (6802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 6802 transitions. [2022-11-03 02:06:12,988 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 6802 transitions. Word has length 23 [2022-11-03 02:06:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:12,988 INFO L495 AbstractCegarLoop]: Abstraction has 2968 states and 6802 transitions. [2022-11-03 02:06:12,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 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) [2022-11-03 02:06:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 6802 transitions. [2022-11-03 02:06:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:06:12,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:12,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:13,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:13,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82cbc629-96e9-4949-80b7-9631170f08bb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-11-03 02:06:13,210 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:06:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash -109627695, now seen corresponding path program 3 times [2022-11-03 02:06:13,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:13,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609859603] [2022-11-03 02:06:13,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:06:14,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:14,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609859603] [2022-11-03 02:06:14,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609859603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:14,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:14,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:06:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36064740] [2022-11-03 02:06:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:14,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:06:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:06:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:06:14,134 INFO L87 Difference]: Start difference. First operand 2968 states and 6802 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) [2022-11-03 02:06:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:17,221 INFO L93 Difference]: Finished difference Result 4889 states and 10980 transitions. [2022-11-03 02:06:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 02:06:17,221 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 [2022-11-03 02:06:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:17,227 INFO L225 Difference]: With dead ends: 4889 [2022-11-03 02:06:17,227 INFO L226 Difference]: Without dead ends: 4800 [2022-11-03 02:06:17,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=1081, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 02:06:17,228 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 414 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:17,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 48 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 02:06:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2022-11-03 02:06:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 3012. [2022-11-03 02:06:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3001 states have (on average 2.3005664778407198) internal successors, (6904), 3011 states have internal predecessors, (6904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 6904 transitions. [2022-11-03 02:06:17,276 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 6904 transitions. Word has length 23 [2022-11-03 02:06:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:17,276 INFO L495 AbstractCegarLoop]: Abstraction has 3012 states and 6904 transitions. [2022-11-03 02:06:17,276 INFO L496 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) [2022-11-03 02:06:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 6904 transitions. [2022-11-03 02:06:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:06:17,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:17,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:17,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-11-03 02:06:17,280 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-11-03 02:06:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash -587090425, now seen corresponding path program 4 times [2022-11-03 02:06:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:17,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059046208] [2022-11-03 02:06:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:06:18,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:18,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059046208] [2022-11-03 02:06:18,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059046208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:18,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:18,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-03 02:06:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272325689] [2022-11-03 02:06:18,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:18,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:06:18,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:18,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:06:18,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:06:18,305 INFO L87 Difference]: Start difference. First operand 3012 states and 6904 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)